A242593 - cp's OEIS frontend

A242593 Triangular array read by rows: T(n,k) is the number of length n words on {B,G} that contain exactly k occurrences of the contiguous substrings BGB or GBG. The substrings are allowed to overlap; n>=0, 0<=k<=max(n-2,0).

n	a(n)
0	1
1	2
2	4
3	6
4	2
5	10
6	4
7	2
8	16
9	10
10	4
11	2
12	26
13	20
14	12
15	4
16	2
17	42
18	40
19	26
20	14
21	4
22	2
23	68
24	76
25	58
26	32
27	16
28	4
29	2
30	110
31	142
32	120
33	78
34	38
35	18
36	4
37	2
38	178
39	260
40	244
41	172
42	100
43	44
44	20
45	4
46	2
47	288
48	470
49	482
50	374
51	232
52	124
53	50
54	22
55	4
56	2
57	466
58	840
59	936
60	784
61	534
62	300
63	150
64	56
65	24
66	4
67	2
68	754
69	1488
70	1788
71	1612
72	1176
73	726
74	376
75	178
76	62
77	26
78	4
79	2

[1, 2, 4, 6, 2, 10, 4, 2, 16, 10, 4, 2, 26, 20, 12, 4, 2, 42, 40, 26, 14, 4, 2, 68, 76, 58, 32, 16, 4, 2, 110, 142, 120, 78, 38, 18, 4, 2, 178, 260, 244, 172, 100, 44, 20, 4, 2, 288, 470, 482, 374, 232, 124, 50, 22, 4, 2, 466, 840, 936, 784, 534, 300, 150, 56, 24, 4, 2, 754, 1488, 1788, 1612, 1176, 726, 376, 178, 62, 26, 4, 2]

cp's OEIS Frontend

A242593 Triangular array read by rows: T(n,k) is the number of length n words on {B,G} that contain exactly k occurrences of the contiguous substrings BGB or GBG. The substrings are allowed to overlap; n>=0, 0<=k<=max(n-2,0).

Table of values

List of values