The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A168573 Numbers requiring exactly one step to reach 14 using map n -> sum of largest digit of all divisors of n (A168239). 1
 15, 34, 44, 106, 115, 134, 142, 155, 213, 214, 314, 321, 334, 404, 453, 515, 713, 1006, 1046, 1114, 1115, 1142, 1214, 1234, 1263, 1402, 1403, 1555, 1703, 1849, 2021, 2031, 2103, 2123, 2234, 2306, 2342, 2434, 2761, 3046, 3062, 3106, 3134, 3142, 3153, 3214 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 REFERENCES J. Earls, "Black Hole 14," Mathematical Bliss, Pleroma Publications, 2009, pages 18-22. ASIN: B002ACVZ6O LINKS Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 MATHEMATICA Select[Range[15, 2200], Total[Max[IntegerDigits[#]]&/@Divisors[#]]==14&] (* Harvey P. Dale, May 22 2012 *) PROG (PARI) is(n)=sumdiv(n, d, vecmax(eval(Vec(Str(d)))))==14&&n>14 \\ Charles R Greathouse IV, May 22 2012 CROSSREFS Sequence in context: A219855 A270072 A085803 * A139578 A345733 A297729 Adjacent sequences:  A168570 A168571 A168572 * A168574 A168575 A168576 KEYWORD base,nonn AUTHOR Jason Earls, Nov 30 2009 STATUS approved

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

Last modified August 3 14:40 EDT 2021. Contains 346438 sequences. (Running on oeis4.)