A057456 Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 10.

10, 29, 109, 599, 4397, 42043, 506683, 7474967, 131807699, 2724711961, 64988430769, 1765037224331, 53982894593057, 1841803943951113, 69532764058102673, 2884247930418152801

Offset: 1

Author

Robert G. Wilson v, Sep 26 2000

Keywords

• nonn
• hard
• more

Comments

Lubomir Alexandrov informs me that he studied this sequence in his 1965 notebook. - N. J. A. Sloane, May 23 2008

Links

• Lubomir Alexandrov, Prime Number Sequences And Matrices Generated By Counting Arithmetic Functions, Communications of the Joint Institute of Nuclear Research, E5-2002-55, Dubna, 2002.

Crossrefs

Cf. A007097.

Programs

Mathematica

NestList[ Prime, 10, 12 ]

Python

from sympy import prime
from itertools import accumulate
def f(an, _): return prime(an)
print(list(accumulate([10]*10, f))) # Michael S. Branicky, Oct 29 2021

Extensions

a(14)-a(16) from Robert G. Wilson v, Mar 07 2017 using Kim Walisch's primecount