A211278 - cp's OEIS frontend

A211278 a(n) is the number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 3].

n	a(n)
0	1
1	3
2	7
3	16
4	38
5	95
6	248
7	668
8	1838
9	5131
10	14470
11	41112
12	117475
13	337203
14	971515
15	2807744
16	8136090
17	23630215
18	68768210
19	200481036
20	585381973
21	1711647959
22	5011157073
23	14687848012
24	43095321203
25	126565380735
26	372030471493
27	1094437253428
28	3221999290418
29	9492019319771
30	27981390048004

[1, 3, 7, 16, 38, 95, 248, 668, 1838, 5131, 14470, 41112, 117475, 337203, 971515, 2807744, 8136090, 23630215, 68768210, 200481036, 585381973, 1711647959, 5011157073, 14687848012, 43095321203, 126565380735, 372030471493, 1094437253428, 3221999290418, 9492019319771, 27981390048004]

cp's OEIS Frontend

A211278 a(n) is the number of n-lettered words in the alphabet {1, 2, 3} with as many occurrences of the substring (consecutive subword) [1, 1] as of [2, 3].

Table of values

List of values