A385123 - cp's OEIS frontend

A385123 Triangle Read by rows: T(n,k) is the number of rooted ordered trees with n non-root nodes with non-root node labels in {1,..,k} such that all labels appear at least once in all groups of sibling nodes.

n	a(n)
0	1
1	0
2	1
3	0
4	2
5	2
6	0
7	5
8	6
9	6
10	0
11	14
12	22
13	36
14	24
15	0
16	42
17	90
18	150
19	240
20	120
21	0
22	132
23	378
24	648
25	1560
26	1800
27	720
28	0
29	429
30	1638
31	3318
32	8400
33	16800
34	15120
35	5040
36	0
37	1430
38	7278
39	18180
40	43128
41	126000
42	191520
43	141120
44	40320
45	0
46	4862
47	32946
48	98502
49	238320
50	834120
51	1905120
52	2328480
53	1451520
54	362880

[1, 0, 1, 0, 2, 2, 0, 5, 6, 6, 0, 14, 22, 36, 24, 0, 42, 90, 150, 240, 120, 0, 132, 378, 648, 1560, 1800, 720, 0, 429, 1638, 3318, 8400, 16800, 15120, 5040, 0, 1430, 7278, 18180, 43128, 126000, 191520, 141120, 40320, 0, 4862, 32946, 98502, 238320, 834120, 1905120, 2328480, 1451520, 362880]

cp's OEIS Frontend

A385123 Triangle Read by rows: T(n,k) is the number of rooted ordered trees with n non-root nodes with non-root node labels in {1,..,k} such that all labels appear at least once in all groups of sibling nodes.

Table of values

List of values