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!)
A238843 Smallest number m such that u + (sum of base-9 digits of u) = m has exactly n solutions. 9
0, 10, 82, 740, 282429536492, 109418989131512359292, 193632597890512706847971583764083347958511186984324587565465147107798425867049291402906445603076812 (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: A287825 A199701 A103460 * A026954 A116879 A154340

Adjacent sequences:  A238840 A238841 A238842 * A238844 A238845 A238846

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 22 16:37 EST 2020. Contains 331152 sequences. (Running on oeis4.)