login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A168548 Least number k requiring n iterations to reach 14 using map n -> sum of largest digit of all divisors of n (A168239). 0
14, 15, 8, 7, 4, 3, 2, 10, 19, 18, 12, 6, 5, 24, 32, 70, 288, 15624, 44031980160 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
a(19) > 1.67*10^46. [From Donovan Johnson, Jul 06 2010]
REFERENCES
J. Earls, "Black Hole 14," Mathematical Bliss, Pleroma Publications, 2009, pages 18-22. ASIN: B002ACVZ6O
LINKS
CROSSREFS
Sequence in context: A165835 A134913 A176169 * A004455 A142865 A089838
KEYWORD
base,more,nonn
AUTHOR
Jason Earls, Nov 29 2009
EXTENSIONS
a(1) changed from 14 to 15. - R. J. Mathar, Mar 06 2010
a(18) from Donovan Johnson, Jul 06 2010
Added initial term a(0)=14. - M. F. Hasler, May 23 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 11:07 EDT 2024. Contains 371905 sequences. (Running on oeis4.)