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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238840 Smallest number m such that u + (sum of base-6 digits of u) = m has exactly n solutions. 9
 0, 37, 10077697, 2821109907494 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The next term is a(5) = 6^((6^9+6^2+8)/5) + 38 = 6^2015548 + 38 and is too large to display. LINKS Max Alekseyev, Table of expressions for a(n), for n=1..100 Max A. Alekseyev, Donovan Johnson and N. J. A. Sloane, On Kaprekar's Junction Numbers, Preprint, 2021. CROSSREFS 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. Sequence in context: A063681 A289820 A087020 * A345467 A329226 A171407 Adjacent sequences:  A238837 A238838 A238839 * A238841 A238842 A238843 KEYWORD nonn,base AUTHOR N. J. A. Sloane, Mar 19 2014 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.

Last modified August 18 02:34 EDT 2022. Contains 356204 sequences. (Running on oeis4.)