login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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).
6
2, 5, 9, 10, 16, 18, 34, 36, 66, 162, 924, 71820, 127005777360
OFFSET
1,1
COMMENTS
323203999999676796 takes 22 iterations to reach 15, but it probably is not the next term.
One could prefix a(0)=1 and change the definition to "... reach a fixed point, 1 or 15." - M. F. Hasler, Nov 08 2015
LINKS
Eric Angelini et al., List the dividers [sic], sum the digits, lost messages reconstructed by N. J. A. Sloane, Dec 21 2024
PROG
(PARI) m=0; for(n=1, 9e9, A086793(n)>m||next; m=A086793(n); print1(n", "))
CROSSREFS
KEYWORD
more,nonn,base
AUTHOR
Jason Earls, Jun 03 2004
EXTENSIONS
Offset corrected and a(13) from Donovan Johnson, Oct 28 2010
STATUS
approved