|
Search: id:A107353
|
|
|
| A107353 |
|
a(0)=0, a(n) = smallest integer not previously used which contains a digit from a(n-1). |
|
+0
25
|
|
| 0, 10, 1, 11, 12, 2, 20, 21, 13, 3, 23, 22, 24, 4, 14, 15, 5, 25, 26, 6, 16, 17, 7, 27, 28, 8, 18, 19, 9, 29, 32, 30, 31, 33, 34, 35, 36, 37, 38, 39, 43, 40, 41, 42, 44, 45, 46, 47, 48, 49, 54, 50, 51, 52, 53, 55, 56, 57, 58, 59, 65, 60, 61, 62, 63, 64, 66, 67, 68, 69, 76, 70
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
EXAMPLE
|
[10] is the smallest available integer having a "0". [1] is the smallest available integer having a "1" or a "0". [11] is the smallest integer having a 1, etc.
|
|
MATHEMATICA
|
f[l_] := Block[{c = 0}, While[ MemberQ[l, c] || Intersection @@ IntegerDigits /@ {Last[l], c} == {}, c++ ]; Return[Append[l, c]] ]; Nest[f, {0}, 71] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A098760 A107408 A129888 this_sequence A130311 A063672 A070606
Adjacent sequences: A107350 A107351 A107352 this_sequence A107354 A107355 A107356
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), May 21 2005
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), May 23 2005
|
|
|
Search completed in 0.002 seconds
|
