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

9, 23, 83, 431, 3001, 27457, 318211, 4535189, 77557187, 1559861749, 36294260117, 963726515729, 28871271685163, 966399998477597, 35843152090509943, 1462429366668283501

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, 9, 12 ]

Python

from sympy import prime
from itertools import accumulate
def anext(an, _): return prime(an)
print(list(accumulate([9]*10, anext))) # Michael S. Branicky, Sep 23 2021

Extensions

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