A121448 - cp's OEIS frontend

A121448 Triangle read by rows: T(n,k) is the number of binary trees with n edges and having k vertices of outdegree 1 (n>=0, k>=0). A binary tree is a rooted tree in which each vertex has at most two children and each child of a vertex is designated as its left or right child.

n	a(n)
0	1
1	0
2	2
3	1
4	0
5	4
6	0
7	6
8	0
9	8
10	2
11	0
12	24
13	0
14	16
15	0
16	20
17	0
18	80
19	0
20	32
21	5
22	0
23	120
24	0
25	240
26	0
27	64
28	0
29	70
30	0
31	560
32	0
33	672
34	0
35	128
36	14
37	0
38	560
39	0
40	2240
41	0
42	1792
43	0
44	256
45	0
46	252
47	0
48	3360
49	0
50	8064
51	0
52	4608
53	0
54	512
55	42
56	0
57	2520
58	0
59	16800
60	0
61	26880
62	0
63	11520
64	0
65	1024
66	0
67	924
68	0
69	18480
70	0

[1, 0, 2, 1, 0, 4, 0, 6, 0, 8, 2, 0, 24, 0, 16, 0, 20, 0, 80, 0, 32, 5, 0, 120, 0, 240, 0, 64, 0, 70, 0, 560, 0, 672, 0, 128, 14, 0, 560, 0, 2240, 0, 1792, 0, 256, 0, 252, 0, 3360, 0, 8064, 0, 4608, 0, 512, 42, 0, 2520, 0, 16800, 0, 26880, 0, 11520, 0, 1024, 0, 924, 0, 18480, 0]

cp's OEIS Frontend

A121448 Triangle read by rows: T(n,k) is the number of binary trees with n edges and having k vertices of outdegree 1 (n>=0, k>=0). A binary tree is a rooted tree in which each vertex has at most two children and each child of a vertex is designated as its left or right child.

Table of values

List of values