|
Search: id:A098766
|
|
|
| A098766 |
|
Slowest increasing sequence with property that in the concatenation of the numbers every pair of consecutive digits differs by 1. |
|
+0
1
|
|
| 0, 1, 2, 10, 12, 32, 101, 212, 323, 432, 1010, 1012, 1210, 1212, 1234, 3212, 3232, 3432, 3434, 3454, 3456, 5434, 5454, 5456, 5654, 5656, 5676, 5678, 7656, 7678, 7876, 7878, 7898, 9876, 54345, 65432, 101010
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
This is true only if the sequence never stops. If it stops, say after one million terms, then there is a slower increasing sequence than this one. Example: [0 1 2 3 4 5 6 7 8 9 87 89 878 989] has 14 terms and increases slower than the above [0 1 2 10 12 32 101 212 323 432 1010 1012 1210 1212] with 14 terms too. To build the above sequence one has to find the longest "bridges" between < 10 >, < 1010 >, < 101010 >, < 10101010 > etc.
|
|
CROSSREFS
|
Adjacent sequences: A098763 A098764 A098765 this_sequence A098767 A098768 A098769
Sequence in context: A004686 A080139 A055701 this_sequence A035928 A014486 A071162
|
|
KEYWORD
|
base,nonn,easy,more
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Oct 02 2004
|
|
|
Search completed in 0.002 seconds
|
