A277678 - cp's OEIS frontend

A277678 Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 11011; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.

n	a(n)
0	1
1	2
2	4
3	8
4	16
5	31
6	1
7	60
8	4
9	116
10	12
11	225
12	30
13	1
14	437
15	70
16	5
17	849
18	158
19	17
20	1649
21	351
22	47
23	1
24	3202
25	770
26	118
27	6
28	6217
29	1669
30	283
31	23
32	12071
33	3578
34	664
35	70
36	1
37	23438
38	7599
39	1535
40	189
41	7
42	45510
43	16016
44	3500
45	480
46	30
47	88368
48	33545
49	7876
50	1182
51	100
52	1
53	171586

[1, 2, 4, 8, 16, 31, 1, 60, 4, 116, 12, 225, 30, 1, 437, 70, 5, 849, 158, 17, 1649, 351, 47, 1, 3202, 770, 118, 6, 6217, 1669, 283, 23, 12071, 3578, 664, 70, 1, 23438, 7599, 1535, 189, 7, 45510, 16016, 3500, 480, 30, 88368, 33545, 7876, 1182, 100, 1, 171586]

cp's OEIS Frontend

A277678 Number T(n,k) of binary words of length n containing exactly k (possibly overlapping) occurrences of the subword 11011; triangle T(n,k), n>=0, k=0..max(0,floor((n-2)/3)), read by rows.

Table of values

List of values