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!)
 A238842 Smallest number m such that u + (sum of base-8 digits of u) = m has exactly n solutions. 9

%I

%S 0,65,8589934593,1152921504606847042

%N Smallest number m such that u + (sum of base-8 digits of u) = m has exactly n solutions.

%C The next term is a(5) = 8^((8^11+76)/7) + 66 = 8^1227133524 + 66 and is too large to display.

%D Max A. Alekseyev, Donovan Johnson and N. J. A. Sloane, On Kaprekar's Junction Numbers, in preparation, 2017.

%H Max Alekseyev, <a href="/A238842/a238842.txt">Table of expressions for a(n), for n=1..100</a>

%Y 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.

%K nonn,base

%O 1,2

%A _N. J. A. Sloane_, Mar 19 2014

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 25 19:09 EST 2020. Contains 331249 sequences. (Running on oeis4.)