login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057453 Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 9. 9
9, 23, 83, 431, 3001, 27457, 318211, 4535189, 77557187, 1559861749, 36294260117, 963726515729, 28871271685163, 966399998477597, 35843152090509943, 1462429366668283501 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
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.
MATHEMATICA
NestList[ Prime, 9, 12 ]
PROG
(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
CROSSREFS
Cf. A007097.
Sequence in context: A211478 A147420 A259170 * A282761 A232612 A339439
KEYWORD
nonn,hard,more
AUTHOR
Robert G. Wilson v, Sep 26 2000
EXTENSIONS
a(14)-a(16) from Robert G. Wilson v, Mar 07 2017 using Kim Walisch's primecount
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 19 22:34 EDT 2024. Contains 374441 sequences. (Running on oeis4.)