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!)
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 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: A063681 A289820 A087020 * A345467 A329226 A171407
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 22:37 EDT 2024. Contains 372497 sequences. (Running on oeis4.)