|
|
A211286
|
|
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 [2, 1, 3].
|
|
0
|
|
|
1, 3, 9, 25, 70, 195, 545, 1526, 4284, 12056, 34013, 96195, 272718, 775011, 2207557, 6302309, 18031941, 51702239, 148548283, 427644891, 1233449265, 3564068374, 10316244428, 29909714061, 86852526228, 252579033621, 735567723900, 2144990584607, 6262870100183, 18307786519038, 53577582619466
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|