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

%I #7 Dec 15 2017 17:37:08

%S 14,15,8,7,4,3,2,10,19,18,12,6,5,24,32,70,288,15624,44031980160

%N Least number k requiring n iterations to reach 14 using map n -> sum of largest digit of all divisors of n (A168239).

%C a(19) > 1.67*10^46. [From _Donovan Johnson_, Jul 06 2010]

%D J. Earls, "Black Hole 14," Mathematical Bliss, Pleroma Publications, 2009, pages 18-22. ASIN: B002ACVZ6O

%K base,more,nonn

%O 0,1

%A _Jason Earls_, Nov 29 2009

%E a(1) changed from 14 to 15. - _R. J. Mathar_, Mar 06 2010

%E a(18) from _Donovan Johnson_, Jul 06 2010

%E Added initial term a(0)=14. - _M. F. Hasler_, May 23 2012

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 19 15:34 EDT 2024. Contains 371794 sequences. (Running on oeis4.)