A124328 - cp's OEIS frontend

A124328 Triangle read by rows: T(n,k) is the number of ordered trees with n edges, with thinning limbs and with root of degree k (1<=k<=n). An ordered tree with thinning limbs is such that if a node has k children, all its children have at most k children.

n	a(n)
1	1
2	1
3	1
4	1
5	2
6	1
7	1
8	5
9	3
10	1
11	1
12	10
13	9
14	4
15	1
16	1
17	22
18	25
19	14
20	5
21	1
22	1
23	46
24	69
25	44
26	20
27	6
28	1
29	1
30	101
31	186
32	137
33	70
34	27
35	7
36	1
37	1
38	220
39	503
40	416
41	235
42	104
43	35
44	8
45	1
46	1
47	492
48	1356
49	1256
50	766
51	375
52	147
53	44
54	9
55	1
56	1
57	1104
58	3663
59	3760
60	2465
61	1296
62	567
63	200
64	54
65	10
66	1
67	1
68	2515
69	9907

[1, 1, 1, 1, 2, 1, 1, 5, 3, 1, 1, 10, 9, 4, 1, 1, 22, 25, 14, 5, 1, 1, 46, 69, 44, 20, 6, 1, 1, 101, 186, 137, 70, 27, 7, 1, 1, 220, 503, 416, 235, 104, 35, 8, 1, 1, 492, 1356, 1256, 766, 375, 147, 44, 9, 1, 1, 1104, 3663, 3760, 2465, 1296, 567, 200, 54, 10, 1, 1, 2515, 9907]

cp's OEIS Frontend

A124328 Triangle read by rows: T(n,k) is the number of ordered trees with n edges, with thinning limbs and with root of degree k (1<=k<=n). An ordered tree with thinning limbs is such that if a node has k children, all its children have at most k children.

Table of values

List of values