A303841 - cp's OEIS frontend

A303841 Triangle read by rows: T(s,n) (s>=1 and 1<=n<=s) = number of weighted trees with n nodes and positive integer node labels with label sum s.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	1
7	1
8	2
9	2
10	2
11	1
12	2
13	4
14	4
15	3
16	1
17	3
18	6
19	10
20	9
21	6
22	1
23	3
24	9
25	17
26	24
27	20
28	11
29	1
30	4
31	12
32	30
33	50
34	63
35	48
36	23
37	1
38	4
39	16
40	44
41	96
42	146
43	164
44	115
45	47
46	1
47	5
48	20
49	67
50	164
51	315
52	437
53	444
54	286
55	106
56	1
57	5
58	25
59	91
60	267
61	592
62	1022
63	1300
64	1204
65	719
66	235
67	1
68	6
69	30
70	126
71	408
72	1059
73	2126
74	3331
75	3899
76	3328
77	1842
78	551

[1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 2, 4, 4, 3, 1, 3, 6, 10, 9, 6, 1, 3, 9, 17, 24, 20, 11, 1, 4, 12, 30, 50, 63, 48, 23, 1, 4, 16, 44, 96, 146, 164, 115, 47, 1, 5, 20, 67, 164, 315, 437, 444, 286, 106, 1, 5, 25, 91, 267, 592, 1022, 1300, 1204, 719, 235, 1, 6, 30, 126, 408, 1059, 2126, 3331, 3899, 3328, 1842, 551]

cp's OEIS Frontend

A303841 Triangle read by rows: T(s,n) (s>=1 and 1<=n<=s) = number of weighted trees with n nodes and positive integer node labels with label sum s.

Table of values

List of values