A natural prime-generating recurrence
arXiv:0710.3217
Abstract
For the sequence defined by a(n) = a(n-1) + gcd(n, a(n-1)) with a(1) = 7 we prove that a(n) - a(n-1) takes on only 1s and primes, making this recurrence a rare "naturally occurring" generator of primes. Toward a generalization of this result to an arbitrary initial condition, we also study the limiting behavior of a(n)/n and a transience property of the evolution.
11 pages, 2 figures; published version
Cited by in corpus (5)
- On formula to compute primes and the nth prime
- Generalizations of the Rowland theorem
- Finding Prime Numbers as Fixed Points of Sequences
- New generating and counting Functions of prime numbers applied to approximate Chebyschev 2nd class function and the least action principle applied to find non-trivial roots of the Zeta function and to Riemann Hypothesis
- Theorems on twin primes-dual case