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 A070061 #16 Jun 01 2024 17:33:28
%S A070061 0,5,25,19,23,18,9,7,4,2,1,282,1529,1586,1397,898,658,538,477,529,736,
%T A070061 586,397,366,294,246,243,187,3237326,3677393,3586673,3553787,3515987,
%U A070061 22572473,518376965,516675965,516963965,41883474553,41881554553,41863638649,35632297938395
%N A070061 Least number of fecundity n (A070562).
%C A070061 a(41) > 2.75*10^14. - _Giovanni Resta_, Jun 04 2013
%D A070061 P. Tougne, Jeux Mathematiques column, Pour La Science (French edition of "Scientific American"), Vol. 82, Aug. 1984, Prob. 6, pp. 101, 104.
%e A070061 a(9)=2 since we have the 9-step chain 2 -> 4 -> 8 -> 16 -> 22 -> 26 -> 38 -> 62 -> 74 -> 102.
%t A070061 f[n_] := Length@ FixedPointList[ # + Times @@ IntegerDigits@# &, n] - 2; t = Table[0, {50}]; k = 1; While[k < 2300000001, a = f@k; If[ t[[a + 1]] == 0, t[[a + 1]] = k; Print[{k, a}]]; k++ ]; t (* _Robert G. Wilson v_, Jun 27 2010 *)
%Y A070061 Cf. A070562, A070257, A003001.
%K A070061 base,hard,nonn
%O A070061 0,2
%A A070061 _Lekraj Beedassy_, May 06 2002
%E A070061 Corrected and extended by _Jason Earls_, May 26 2002
%E A070061 a(34)-a(36) from _Robert G. Wilson v_, Jun 27 2010
%E A070061 a(37)-a(40) from _Giovanni Resta_, Jun 04 2013