A119473 - cp's OEIS frontend

A119473 Triangle read by rows: T(n,k) is number of binary words of length n and having k runs of 0's of odd length, 0 <= k <= ceiling(n/2). (A run of 0's is a subsequence of consecutive 0's of maximal length.)

n	a(n)
0	1
1	1
2	1
3	2
4	2
5	3
6	4
7	1
8	5
9	8
10	3
11	8
12	15
13	8
14	1
15	13
16	28
17	19
18	4
19	21
20	51
21	42
22	13
23	1
24	34
25	92
26	89
27	36
28	5
29	55
30	164
31	182
32	91
33	19
34	1
35	89
36	290
37	363
38	216
39	60
40	6
41	144
42	509
43	709
44	489
45	170
46	26
47	1
48	233
49	888
50	1362
51	1068
52	446
53	92
54	7
55	377
56	1541
57	2580
58	2266
59	1105
60	288
61	34
62	1
63	610
64	2662
65	4830

[1, 1, 1, 2, 2, 3, 4, 1, 5, 8, 3, 8, 15, 8, 1, 13, 28, 19, 4, 21, 51, 42, 13, 1, 34, 92, 89, 36, 5, 55, 164, 182, 91, 19, 1, 89, 290, 363, 216, 60, 6, 144, 509, 709, 489, 170, 26, 1, 233, 888, 1362, 1068, 446, 92, 7, 377, 1541, 2580, 2266, 1105, 288, 34, 1, 610, 2662, 4830]

cp's OEIS Frontend

A119473 Triangle read by rows: T(n,k) is number of binary words of length n and having k runs of 0's of odd length, 0 <= k <= ceiling(n/2). (A run of 0's is a subsequence of consecutive 0's of maximal length.)

Table of values

List of values