|
|
A209233
|
|
A two-digit Look-and-Say sequence starting with 11: each term summarizes the increasing two-digit substrings of the previous term.
|
|
6
|
|
|
11, 111, 211, 111121, 311112121, 311212221131, 211212113221222231, 211312113421422123131132, 311212413114421122123331132134242, 411412313114421122123224331132233134141342144, 411312413414321322323124431232233234441242143244
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
a(16) is the first term containing a zero; this is due to the fact that a(15) is the first term having exactly 10 occurrences of a two-digit number, namely 10 x 31.
|
|
LINKS
|
|
|
EXAMPLE
|
a(0) = 11: 1 x 11 --> a(1) = 111;
a(1) = 111: 2 x 11 --> a(2) = 211;
a(2) = 211: 1 x 11 and 1 x 21 --> a(3) = 111121;
a(3) = 111121: 3 x 11, 1 x 12 and 1 x 21 --> a(4) = 311112121.
|
|
PROG
|
(Haskell) See Link.
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|