2,1
a(5) = 10^1111111111124 + 10000000000002 [From Max Alekseyev]
a(6) = 10^2222222222224 + 10000000000002 [From Max Alekseyev]
M. Gardner, Time Travel and Other Mathematical Bewilderments. Freeman, NY, 1988, p. 116.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
Terry Trotter, Charlene numbers
a(n) = the smallest m such that there are exactly n solutions to A062028(x)=m.
a(2)=101 since 101 is the smallest number with two generators: 101 = A062028(91) = A062028(100).
Cf. A003052
Sequence in context: A082521 A138826 A138720 * A015164 A204749 A144469
Adjacent sequences: A006061 A006062 A006063 * A006065 A006066 A006067
nonn,base
N. J. A. Sloane (njas(AT)research.att.com).
Edited by Max Alekseyev (maxale(AT)gmail.com), Jun 01 2011
