login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

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

REFERENCES

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

LINKS

Table of n, a(n) for n=1..7.

Max Alekseyev, Table of expressions for a(n), for n=1..100

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: A180029 A133129 A103458 * A100310 A124963 A295167

Adjacent sequences:  A238838 A238839 A238840 * A238842 A238843 A238844

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 17 09:54 EST 2020. Contains 330949 sequences. (Running on oeis4.)