|
|
A211283
|
|
a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1, 1] as of [1, 2, 1].
|
|
1
|
|
|
1, 3, 9, 25, 70, 200, 569, 1614, 4596, 13114, 37431, 106978, 306238, 877713, 2518647, 7236947, 20820856, 59975554, 172974739, 499480558, 1444006498, 4179496707, 12110820951, 35132286213, 102025868324, 296601381043, 863142552053, 2514348427139, 7331433782002, 21397338280852, 62506435095245
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|