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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A230867 Smallest number m such that u + (sum of base-5 digits of u) = m has exactly n solutions. 10
 0, 6, 26, 632, 1953134, 30517578152 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Indices of records in A230866: a(n) is the index of the first n in A230866. The next two terms are a(7) = 5^165 + 27, a(8) = 5^317 + 633. REFERENCES Max A. Alekseyev, Donovan Johnson and N. J. A. Sloane, On Kaprekar's Junction Numbers, in preparation, 2017. LINKS Max Alekseyev, Table of expressions for a(n), for n=1..100 EXAMPLE a(5) = 1953134 corresponds to the five solutions: 1953099 (base-5: 444444344) 1953103 (base-5: 444444403) 1953105 (base-5: 444444410) 1953129 (base-5: 1000000004) 1953131 (base-5: 1000000011). CROSSREFS A230868 gives the leading power of 5 in a(n). Smallest number m such that u + (sum of base-b digits of u) = m has exactly n solutions, for bases 2 through 10: A230303, A230640, A230638, A230867, A238840, A238841, A238842, A238843, A006064. Cf. A230865, A230866. Sequence in context: A323868 A226980 A199591 * A137088 A179162 A285806 Adjacent sequences:  A230864 A230865 A230866 * A230868 A230869 A230870 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Nov 05 2013 EXTENSIONS a(5) corrected by Donovan Johnson, Nov 05 2013 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 January 18 19:43 EST 2020. Contains 331029 sequences. (Running on oeis4.)