|
Search: id:A113138
|
|
|
| A113138 |
|
Self-describing sequence made of strings of consecutive integers. The number of elements in each string is the sequence itself. |
|
+0
1
|
|
| 1, 3, 4, 5, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 3, 4, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 3, 4, 5, 1, 2, 3, 4, 1, 3, 4, 1, 2, 3
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The less interesting sequence 1,1,1,1,1,1,1,1, ... obeys the same rule.
|
|
EXAMPLE
|
First string is "1", having 1 element. Second string is "3,4,5" having 3 elements. Third string is "1,2,3,4" which has 4 elements. Next string is "1,2,3,4,5", made of 5 elements. Next string is "1", having only 1 element, etc. So we have 1 element, then 3, then 4, then 5, then 1, etc. This is the sequence itself.
|
|
CROSSREFS
|
Sequence in context: A060115 A100649 A158962 this_sequence A010263 A011303 A051993
Adjacent sequences: A113135 A113136 A113137 this_sequence A113139 A113140 A113141
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Eric Angelini (eric.angelini(AT)kntv.be), Jan 04 2006
|
|
|
Search completed in 0.002 seconds
|
