|
Search: id:A030283
|
|
|
| A030283 |
|
a(0) = 0; for n>0, a(n) is the smallest number which does not use any digit used by a(n-1). |
|
+0
13
|
|
| 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 22, 30, 41, 50, 61, 70, 81, 90, 111, 200, 311, 400, 511, 600, 711, 800, 911, 2000, 3111, 4000, 5111, 6000, 7111, 8000, 9111, 20000, 31111, 40000, 51111, 60000, 71111, 80000, 91111, 200000, 311111, 400000, 511111, 600000
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
The sequence is infinite.
|
|
MATHEMATICA
|
a = {0}; For[n = 1, n < 1000000, n++, If[Length[Intersection[IntegerDigits[n], IntegerDigits[a[[ -1]]]]] == 0, AppendTo[a, n]]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), May 30 2007
|
|
CROSSREFS
|
Cf. A068860, A068861.
Sequence in context: A132271 A116069 A081511 this_sequence A114806 A039229 A054659
Adjacent sequences: A030280 A030281 A030282 this_sequence A030284 A030285 A030286
|
|
KEYWORD
|
nonn,base,nice
|
|
AUTHOR
|
Patrick De Geest (pdg(AT)worldofnumbers.com)
|
|
EXTENSIONS
|
Edited by njas at the suggestion of Rick L. Shepherd, Sep 27 2007
|
|
|
Search completed in 0.002 seconds
|
