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 A284890 #8 May 08 2022 11:49:20 %S A284890 2,3,5,8,9,11,16,17,24,25,28,29,39,41,54,55,58,59,76,77,81,83,106,107, %T A284890 135,137,170,171,173,213,215,218,219,221,227,276,277,336,337,405,407, %U A284890 412,413,417,419,500,501,503,599,708,709,836,837,839,985,988,989 %N A284890 a(1)=2, and then a(n+1) = a(n) + k where prime(k) is the least prime dividing a(n). %H A284890 Rémy Sigrist, <a href="/A284890/b284890.txt">Table of n, a(n) for n = 1..2297</a> %H A284890 Rémy Sigrist, <a href="/A284890/a284890.txt">C program for A284890</a> %F A284890 a(n+1) = a(n) + A055396(a(n)) for any n>1. %e A284890 a(9) = 24 = prime(1)^3*prime(2), hence a(10) = 24+1 = 25. %e A284890 a(14) = 41 = prime(13), hence a(15) = 41+13 = 54. %t A284890 NestList[#+PrimePi[FactorInteger[#][[1,1]]]&,2,60] (* _Harvey P. Dale_, May 08 2022 *) %Y A284890 Cf. A055396, A076271. %K A284890 nonn %O A284890 1,1 %A A284890 _Rémy Sigrist_, Apr 05 2017