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 A095347 #16 Dec 21 2024 22:11:42 %S A095347 2,5,9,10,16,18,34,36,66,162,924,71820,127005777360 %N A095347 n sets a new record for number of iterations of A034690 (sum of digits of the divisors of n) needed to reach 15 (see A086793). %C A095347 323203999999676796 takes 22 iterations to reach 15, but it probably is not the next term. %C A095347 One could prefix a(0)=1 and change the definition to "... reach a fixed point, 1 or 15." - _M. F. Hasler_, Nov 08 2015 %H A095347 Eric Angelini et al., <a href="/A086793/a086793.txt">List the dividers [sic], sum the digits</a>, lost messages reconstructed by _N. J. A. Sloane_, Dec 21 2024 %o A095347 (PARI) m=0;for(n=1,9e9, A086793(n)>m||next;m=A086793(n);print1(n",")) %Y A095347 Cf. A034690, A086793, A094501. %K A095347 more,nonn,base %O A095347 1,1 %A A095347 _Jason Earls_, Jun 03 2004 %E A095347 Offset corrected and a(13) from _Donovan Johnson_, Oct 28 2010