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!)
A238841 Smallest number m such that u + (sum of base-7 digits of u) = m has exactly n solutions. 9
0, 8, 50, 352, 282475258, 232630513987258, 418377847259091645147530834859099334519176045887014771594 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
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: A133129 A103458 A339687 * A100310 A124963 A295167
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 April 23 07:16 EDT 2024. Contains 371905 sequences. (Running on oeis4.)