The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #18 Oct 29 2021 07:27:23
%S 10,29,109,599,4397,42043,506683,7474967,131807699,2724711961,
%T 64988430769,1765037224331,53982894593057,1841803943951113,
%U 69532764058102673,2884247930418152801
%N Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 10.
%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="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, 10, 12 ]
%o (Python)
%o from sympy import prime
%o from itertools import accumulate
%o def f(an, _): return prime(an)
%o print(list(accumulate([10]*10, f))) # _Michael S. Branicky_, Oct 29 2021
%Y Cf. A007097.
%K nonn,hard,more
%O 1,1
%A _Robert G. Wilson v_, Sep 26 2000
%E a(14)-a(16) from _Robert G. Wilson v_, Mar 07 2017 using Kim Walisch's primecount