|
Search: id:A102234
|
|
|
| A102234 |
|
Slowest increasing sequence such that no digit "d" has a copy of itself at "d" digits, left or right. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 18, 19, 21, 31, 32, 34, 35, 36, 37, 38, 39, 41, 42, 51, 52, 53, 54, 56, 57, 58, 59, 61, 62, 63, 71, 72, 73, 74, 75, 76, 78, 79, 81, 82, 83, 84, 121, 312, 412
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
Take integer [78] in the sequence for instance : ...73 74 75 76 [78] 79 81 82 83...
The digit "7", jumping 7 digits back, ends on "3" [73] which is not "7"; jumping 7 digits to the right ends on "2" which, again, is not a "7". The same can be said for "8" (left -> "7"; right -> "3")
|
|
CROSSREFS
|
Cf. A102150.
Sequence in context: A050759 A039274 A102487 this_sequence A082757 A032881 A032848
Adjacent sequences: A102231 A102232 A102233 this_sequence A102235 A102236 A102237
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Feb 18 2005
|
|
|
Search completed in 0.002 seconds
|
