login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A238840
Smallest number m such that u + (sum of base-6 digits of u) = m has exactly n solutions.
9
0, 37, 10077697, 2821109907494
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 12:3 (2022), 115-155.
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