|
|
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
|
|
|
REFERENCES
|
J. Earls, "Black Hole 14," Mathematical Bliss, Pleroma Publications, 2009, pages 18-22. ASIN: B002ACVZ6O
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,more,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|