Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Jul 18 2021 16:33:33
%S 6,13,41,179,1063,8527,87803,1128889,17624813,326851121,7069067389,
%T 175650481151,4952019383323,156740126985437,5519908106212193,
%U 214616508361122337,9150317141480822981
%N Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 6.
%C _Lubomir Alexandrov_ informs me that he studied this sequence in his 1965 notebook. - _N. J. A. Sloane_, May 23 2008
%H Lubomir Alexandrov, <a href="https://arxiv.org/abs/math/9811096">On the nonasymptotic prime number distribution</a>, 1998 preprint, arXiv:math/9811096 [math.NT] (See Appendix.)
%H Lubomir Alexandrov, <a href="http://www1.jinr.ru/Preprints/2002/055(E5-2002-55).pdf">Prime Number Sequences And Matrices Generated By Counting Arithmetic Functions</a>, Communications of the Joint Institute of Nuclear Research, E5-2002-55, Dubna, 2002.
%t NestList[ Prime, 6, 13 ]
%Y Cf. A007097, A057450, A057452, A057453.
%K nonn,hard,more
%O 1,1
%A _Robert G. Wilson v_, Sep 26 2000
%E a(14) from _Ray Chandler_, Nov 04 2004
%E a(15)-a(17) from _Robert G. Wilson v_, Mar 07 2017 using Kim Walisch's primecount