A196201 - cp's OEIS frontend

A196201 T(n,k) counts ordered complete ternary trees with 2*n-1 leaves having k internal vertices colored black, the remaining n-1-k internal vertices colored white, and such that each vertex and its rightmost child have different colors.

n	a(n)
1	1
2	1
3	1
4	2
5	6
6	2
7	5
8	28
9	28
10	5
11	14
12	120
13	230
14	120
15	14
16	27
17	326
18	985
19	985
20	326
21	27
22	56
23	877
24	3701
25	5848
26	3701
27	877
28	56
29	116
30	2212
31	12096
32	26988
33	26988
34	12096
35	2212
36	116
37	221
38	4808
39	31740
40	91402
41	128738
42	91402
43	31740
44	4808
45	221

[1, 1, 1, 2, 6, 2, 5, 28, 28, 5, 14, 120, 230, 120, 14, 27, 326, 985, 985, 326, 27, 56, 877, 3701, 5848, 3701, 877, 56, 116, 2212, 12096, 26988, 26988, 12096, 2212, 116, 221, 4808, 31740, 91402, 128738, 91402, 31740, 4808, 221]

cp's OEIS Frontend

A196201 T(n,k) counts ordered complete ternary trees with 2*n-1 leaves having k internal vertices colored black, the remaining n-1-k internal vertices colored white, and such that each vertex and its rightmost child have different colors.

Table of values

List of values