|
|
A006064
|
|
Smallest junction number with n generators.
(Formerly M5367)
|
|
18
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Strictly speaking, a junction number is a number n with more than one solution to x+digitsum(x) = n. However, it seems best to start this sequence with n=0, for which there is just one solution, x=0. - N. J. A. Sloane, Oct 31 2013.
a(3) = 10^13 + 1 was found by Narasinga Rao, who reports that Kaprekar verified that it is the smallest term. No details of Kaprekar's proof were given.
a(4) = 10^24 + 102 was conjectured by Narasinga Rao.
a(7) = 10^( (10^24 + 10^13 + 115) / 9 ) + 10^13 + 2. - Max Alekseyev
|
|
REFERENCES
|
M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 116.
D. R. Kaprekar, The Mathematics of the New Self Numbers, Privately printed, 311 Devlali Camp, Devlali, India, 1963.
Narasinga Rao, A. On a technique for obtaining numbers with a multiplicity of generators. Math. Student 34 1966 79--84 (1967). MR0229573 (37 #5147)
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
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).
Terry Trotter, Charlene numbers [Warning: As of March 2018 this site appears to have been hacked. Proceed with great caution. The original content should be retrieved from the Wayback machine and added here. - N. J. A. Sloane, Mar 29 2018]
|
|
FORMULA
|
a(n) = the smallest m such that there are exactly n solutions to A062028(x)=m.
|
|
EXAMPLE
|
a(2) = 101 since 101 is the smallest number with two generators: 101 = A062028(91) = A062028(100).
a(4) = 10^24 + 102 = 1000000000000000000000102 has exactly four inverses w.r.t. A062028, namely 999999999999999999999893, 999999999999999999999902, 1000000000000000000000091 and 1000000000000000000000100.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(1) added, a(5) corrected, a(7)-a(8) added by Max Alekseyev, Oct 26 2013
|
|
STATUS
|
approved
|
|
|
|