|
Search: id:A102235
|
|
|
| A102235 |
|
Slowest increasing sequence such that no digit "d" from any a(n) has a copy of itself in a(n+d), left or right. |
|
+0
1
|
|
| 1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 22, 23, 31, 33, 41, 52, 54, 55, 56, 57, 61, 62, 63, 64, 71, 72, 81, 83, 84, 85, 86, 88, 89, 91, 92, 93, 94, 95, 96, 97, 99, 111, 222, 223, 311, 333, 411, 421, 424, 431, 533, 535, 551, 552, 554, 611, 622, 623, 631, 633, 641, 722, 724
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
Take integer [41] in the sequence, for instance : ...22 23 31 33 [41] 52 54 55 56.
The digit "4", jumping 4 integers back, ends on [22] which has no "4"; jumping 4 digits to the right ends on [56] which, again, has no "4". The same can be said for "1" (left -> [33]; right ->[52])
|
|
CROSSREFS
|
Cf. A102150.
Sequence in context: A076641 A076643 A127204 this_sequence A107272 A039228 A161383
Adjacent sequences: A102232 A102233 A102234 this_sequence A102236 A102237 A102238
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Feb 18 2005
|
|
|
Search completed in 0.002 seconds
|
