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

%I #20 Sep 23 2021 09:34:26

%S 9,23,83,431,3001,27457,318211,4535189,77557187,1559861749,

%T 36294260117,963726515729,28871271685163,966399998477597,

%U 35843152090509943,1462429366668283501

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

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

%o (Python)

%o from sympy import prime

%o from itertools import accumulate

%o def anext(an, _): return prime(an)

%o print(list(accumulate([9]*10, anext))) # _Michael S. Branicky_, Sep 23 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