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 A336382 #15 Jul 26 2020 08:50:26 %S A336382 2,1,6,4,24,22,20,4020,4280,22198,22194,22200,31400,360652,360648, %T A336382 370260,604062,604060,1357203,2010734,4652359,4652354,4652352, %U A336382 17051708,20831337,20831329,20831324,47326699,47326692,123346278,256526120,428045488,436273045 %N A336382 Smallest number requiring n steps to reach a prime under the "add a digit" process described in A241181. %C A336382 This sequence is to A241181 what A241182 is to A241180. %C A336382 As there are arbitrary large prime gaps, the sequence A241181 is unbounded, and the present sequence is infinite. %H A336382 Rémy Sigrist, <a href="/A336382/a336382.gp.txt">PARI program for A336382</a> %F A336382 A241181(a(n)) = n. %e A336382 The number 2 is the least prime number, so a(0) = 2. %e A336382 The number 6 is the least one requiring 2 "add a digit" steps to reach a prime number, so a(2) = 6. %o A336382 (PARI) See Links section. %Y A336382 Cf. A241180, A241181, A241182. %K A336382 nonn,base %O A336382 0,1 %A A336382 _Rémy Sigrist_, Jul 25 2020