This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A057456 #18 Oct 29 2021 07:27:23 %S A057456 10,29,109,599,4397,42043,506683,7474967,131807699,2724711961, %T A057456 64988430769,1765037224331,53982894593057,1841803943951113, %U A057456 69532764058102673,2884247930418152801 %N A057456 Prime recurrence: a(n+1) = a(n)-th prime, with a(1) = 10. %C A057456 _Lubomir Alexandrov_ informs me that he studied this sequence in his 1965 notebook. - _N. J. A. Sloane_, May 23 2008 %H A057456 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 A057456 NestList[ Prime, 10, 12 ] %o A057456 (Python) %o A057456 from sympy import prime %o A057456 from itertools import accumulate %o A057456 def f(an, _): return prime(an) %o A057456 print(list(accumulate([10]*10, f))) # _Michael S. Branicky_, Oct 29 2021 %Y A057456 Cf. A007097. %K A057456 nonn,hard,more %O A057456 1,1 %A A057456 _Robert G. Wilson v_, Sep 26 2000 %E A057456 a(14)-a(16) from _Robert G. Wilson v_, Mar 07 2017 using Kim Walisch's primecount