A325201 - cp's OEIS frontend

A325201 Square array whose entry A(n,k) is the number of labeled rooted trees on a set of size n where each node has at most k neighbors that are further away from the root than the node itself, for n >= 0, k >= 0, read by descending antidiagonals.

n	a(n)
1	0
2	0
3	0
4	0
5	1
6	0
7	0
8	1
9	2
10	0
11	0
12	1
13	2
14	6
15	0
16	0
17	1
18	2
19	9
20	24
21	0
22	0
23	1
24	2
25	9
26	60
27	120
28	0
29	0
30	1
31	2
32	9
33	64
34	540
35	720
36	0
37	0
38	1
39	2
40	9
41	64
42	620
43	6120
44	5040
45	0
46	0
47	1
48	2
49	9
50	64
51	625
52	7620
53	83790
54	40320
55	0
56	0
57	1
58	2
59	9
60	64
61	625
62	7770
63	113610
64	1345680
65	362880
66	0
67	0
68	1
69	2
70	9
71	64
72	625
73	7776
74	117390
75	1992480
76	24811920
77	3628800
78	0

[0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 1, 2, 6, 0, 0, 1, 2, 9, 24, 0, 0, 1, 2, 9, 60, 120, 0, 0, 1, 2, 9, 64, 540, 720, 0, 0, 1, 2, 9, 64, 620, 6120, 5040, 0, 0, 1, 2, 9, 64, 625, 7620, 83790, 40320, 0, 0, 1, 2, 9, 64, 625, 7770, 113610, 1345680, 362880, 0, 0, 1, 2, 9, 64, 625, 7776, 117390, 1992480, 24811920, 3628800, 0]

cp's OEIS Frontend

A325201 Square array whose entry A(n,k) is the number of labeled rooted trees on a set of size n where each node has at most k neighbors that are further away from the root than the node itself, for n >= 0, k >= 0, read by descending antidiagonals.

Table of values

List of values