A303842 - cp's OEIS frontend

A303842 Triangle read by rows: T(s,n) (s>=1 and 2<=n<=s+1) = number of trees with n nodes and positive integer edge labels with label sum s.

n	a(n)
1	1
2	1
3	1
4	1
5	1
6	2
7	1
8	2
9	3
10	3
11	1
12	2
13	6
14	6
15	6
16	1
17	3
18	9
19	15
20	16
21	11
22	1
23	3
24	13
25	26
26	43
27	37
28	23
29	1
30	4
31	17
32	46
33	88
34	116
35	96
36	47
37	1
38	4
39	23
40	68
41	169
42	273
43	329
44	239
45	106
46	1
47	5
48	28
49	103
50	287
51	585
52	869
53	918
54	622
55	235
56	1
57	5
58	35
59	141
60	467
61	1104
62	2031
63	2695
64	2609
65	1607
66	551

[1, 1, 1, 1, 1, 2, 1, 2, 3, 3, 1, 2, 6, 6, 6, 1, 3, 9, 15, 16, 11, 1, 3, 13, 26, 43, 37, 23, 1, 4, 17, 46, 88, 116, 96, 47, 1, 4, 23, 68, 169, 273, 329, 239, 106, 1, 5, 28, 103, 287, 585, 869, 918, 622, 235, 1, 5, 35, 141, 467, 1104, 2031, 2695, 2609, 1607, 551]

cp's OEIS Frontend

A303842 Triangle read by rows: T(s,n) (s>=1 and 2<=n<=s+1) = number of trees with n nodes and positive integer edge labels with label sum s.

Table of values

List of values