login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238842 Smallest number m such that u + (sum of base-8 digits of u) = m has exactly n solutions. 9
0, 65, 8589934593, 1152921504606847042 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

The next term is a(5) = 8^((8^11+76)/7) + 66 = 8^1227133524 + 66 and is too large to display.

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..4.

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: A238612 A185823 A035519 * A059755 A215657 A157631

Adjacent sequences:  A238839 A238840 A238841 * A238843 A238844 A238845

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 December 8 14:38 EST 2019. Contains 329865 sequences. (Running on oeis4.)