The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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.
LINKS
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).
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.
Sequence in context: A323868 A226980 A199591 * A137088 A356813 A179162
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 6 03:51 EDT 2024. Contains 373110 sequences. (Running on oeis4.)