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

%I

%S 0,6,26,632,1953134,30517578152

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

%C Indices of records in A230866: a(n) is the index of the first n in A230866.

%C The next two terms are a(7) = 5^165 + 27, a(8) = 5^317 + 633.

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

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

%e a(5) = 1953134 corresponds to the five solutions:

%e 1953099 (base-5: 444444344)

%e 1953103 (base-5: 444444403)

%e 1953105 (base-5: 444444410)

%e 1953129 (base-5: 1000000004)

%e 1953131 (base-5: 1000000011).

%Y A230868 gives the leading power of 5 in a(n).

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

%Y Cf. A230865, A230866.

%K nonn,base

%O 1,2

%A _N. J. A. Sloane_, Nov 05 2013

%E a(5) corrected by _Donovan Johnson_, Nov 05 2013

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 01:07 EDT 2021. Contains 346429 sequences. (Running on oeis4.)