|
| |
|
|
A211297
|
|
a(n) = number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 2, 1] as those of [1, 3, 1].
|
|
0
|
|
|
|
1, 3, 9, 25, 69, 195, 555, 1573, 4457, 12677, 36165, 103323, 295639, 847587, 2434755, 7006089, 20193261, 58296927, 168567687, 488155597, 1415686337, 4111268669, 11955274925, 34808988199, 101471734355, 296139036809, 865204909777, 2530413173787, 7407817001559, 21706686476055, 63662015359655
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
| |
| |
|
|
