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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A238842 Smallest number m such that u + (sum of base-8 digits of u) = m has exactly n solutions. 9
 0, 65, 8589934593, 1152921504606847042 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The next term is a(5) = 8^((8^11+76)/7) + 66 = 8^1227133524 + 66 and is too large to display. LINKS Table of n, a(n) for n=1..4. Max Alekseyev, Table of expressions for a(n), for n=1..100 Max A. Alekseyev and N. J. A. Sloane, On Kaprekar's Junction Numbers, arXiv:2112.14365, 2021; Journal of Combinatorics and Number Theory, 2022 (to appear). 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: A185823 A035519 A368189 * A059755 A215657 A157631 Adjacent sequences: A238839 A238840 A238841 * A238843 A238844 A238845 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 July 16 10:51 EDT 2024. Contains 374345 sequences. (Running on oeis4.)