|
Search: id:A125886
|
|
|
| A125886 |
|
a(1) = 1, a(n) = smallest positive number b not among a(1)..a(n-1) such that the last digit of b = the first digit of a(n-1). |
|
+0
3
|
|
| 1, 11, 21, 12, 31, 13, 41, 14, 51, 15, 61, 16, 71, 17, 81, 18, 91, 19, 101, 111, 121, 131, 141, 151, 161, 171, 181, 191, 201, 22, 32, 23, 42, 24, 52, 25, 62, 26, 72, 27, 82, 28, 92, 29, 102, 211, 112, 221, 122, 231, 132, 241, 142, 251, 152, 261, 162, 271, 172, 281, 182
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
A dyslexic person might have trouble distinguishing this sequence from A125887!
|
|
MATHEMATICA
|
s={1}; fi=1; Do[Do[id=IntegerDigits[i]; la=id[[ -1]]; If[fi==la&&FreeQ[s, i], AppendTo[s, i]; fi=id[[1]]; Break[]], {i, 11, 10^5}], {999}]; s
|
|
CROSSREFS
|
Cf. A125887.
Sequence in context: A061384 A071154 A071161 this_sequence A067574 A096312 A031032
Adjacent sequences: A125883 A125884 A125885 this_sequence A125887 A125888 A125889
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)gmail.com), Dec 13 2006
|
|
|
Search completed in 0.002 seconds
|
