A094262 - cp's OEIS frontend

A094262 Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.

n	a(n)
1	1
2	1
3	2
4	1
5	1
6	6
7	12
8	10
9	3
10	1
11	14
12	61
13	124
14	131
15	70
16	15
17	1
18	30
19	240
20	890
21	1830
22	2226
23	1600
24	630
25	105
26	1
27	62
28	841
29	5060
30	16990
31	35216
32	47062
33	40796
34	22225
35	6930
36	945
37	1
38	126
39	2772
40	25410
41	127953
42	401436
43	836976
44	1196532
45	1182195
46	795718
47	349020
48	90090
49	10395

[1, 1, 2, 1, 1, 6, 12, 10, 3, 1, 14, 61, 124, 131, 70, 15, 1, 30, 240, 890, 1830, 2226, 1600, 630, 105, 1, 62, 841, 5060, 16990, 35216, 47062, 40796, 22225, 6930, 945, 1, 126, 2772, 25410, 127953, 401436, 836976, 1196532, 1182195, 795718, 349020, 90090, 10395]

cp's OEIS Frontend

A094262 Triangle read by rows: T(n,k) is the number of rooted trees with k nodes which are disjoint sets of labels with union {1..n}. If a node has an empty set of labels then it must have at least two children.

Table of values

List of values