|
| |
|
|
A107682
|
|
The size of every run of identical digits is given by the digit immediately following immediately the said run. There can be no two identical runs in the sequence.
|
|
1
|
|
|
|
0, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 6, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 9, 9, 2, 2, 2, 3, 3, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 5, 5, 2, 2, 2, 2, 2, 2, 6, 6, 2, 2, 2, 2, 2, 2, 2, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 8, 8, 2, 2, 2, 2, 2, 2
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,4
|
|
|
COMMENTS
|
The sequence is finite.
|
|
|
LINKS
|
Table of n, a(n) for n=0..104.
E. Angelini, Auto-chunks.
E. Angelini, Auto-chunks [Cached copy with permission]
|
|
|
EXAMPLE
|
First run ("0") is made of 1 "identical digit(s)", thus is followed by 1; second run ("11") is made of 2 identical digits, thus followed by 2; third run ("2") is made of 1 "identical digit(s)", thus followed by 1; etc.
|
|
|
CROSSREFS
|
Sequence in context: A309400 A294306 A181348 * A349703 A178239 A260534
Adjacent sequences: A107679 A107680 A107681 * A107683 A107684 A107685
|
|
|
KEYWORD
|
base,easy,fini,nonn
|
|
|
AUTHOR
|
Eric Angelini, Jun 10 2005
|
|
|
STATUS
|
approved
|
| |
|
|
