A106375 - cp's OEIS frontend

A106375 Triangle read by rows: T(n,k) is the number of binary trees (each vertex has 0, or 1 left, or 1 right, or 2 children) with k edges and all leaves at level n.

n	a(n)
1	2
2	1
3	0
4	4
5	2
6	4
7	4
8	1
9	0
10	0
11	8
12	4
13	8
14	24
15	18
16	36
17	48
18	40
19	36
20	24
21	8
22	1
23	0
24	0
25	0
26	16
27	8
28	16
29	48
30	100
31	136
32	240
33	528
34	616
35	1152
36	1936
37	2466
38	3716
39	4912
40	5840
41	7088
42	7768
43	7696
44	7120
45	5796
46	4056
47	2464
48	1232
49	456
50	112
51	16
52	1
53	0
54	0
55	0
56	0
57	32
58	16
59	32
60	96
61	200
62	528
63	736
64	1632

[2, 1, 0, 4, 2, 4, 4, 1, 0, 0, 8, 4, 8, 24, 18, 36, 48, 40, 36, 24, 8, 1, 0, 0, 0, 16, 8, 16, 48, 100, 136, 240, 528, 616, 1152, 1936, 2466, 3716, 4912, 5840, 7088, 7768, 7696, 7120, 5796, 4056, 2464, 1232, 456, 112, 16, 1, 0, 0, 0, 0, 32, 16, 32, 96, 200, 528, 736, 1632]

cp's OEIS Frontend

A106375 Triangle read by rows: T(n,k) is the number of binary trees (each vertex has 0, or 1 left, or 1 right, or 2 children) with k edges and all leaves at level n.

Table of values

List of values