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 A156672 #9 Mar 25 2025 10:07:35 %S A156672 2,5,11,13,17,29,41,47,59,73,83,97,113,127,137,149,163,173,191,211, %T A156672 223,233,241,251,263,277,293,307,317,331,347,367,383,397,419,433,443, %U A156672 457,479,499,521,541,557,577,599,631,641,653,673,691,709,727,743,757,787 %N A156672 a(1)=2, a(n+1) is the smallest prime >= a(n) + sum of digits of a(n). %C A156672 Heuristically, a(n) ~ kn log n for some k >= 4.5/log 10. %H A156672 Harvey P. Dale, <a href="/A156672/b156672.txt">Table of n, a(n) for n = 1..1000</a> %e A156672 2, 5(>4=2+2), 11(>10>5+5), 13(=13=11+1+1), 17(=17=13+1+3), 29(>25=17+1+7), etc. %t A156672 NestList[NextPrime[#+Total[IntegerDigits[#]]-1]&,2,60] (* _Harvey P. Dale_, Mar 25 2025 *) %Y A156672 Cf. A156604. %K A156672 nonn,base,less %O A156672 1,1 %A A156672 _Juri-Stepan Gerasimov_, Feb 13 2009 %E A156672 Corrected by _Charles R Greathouse IV_, Mar 19 2010