A258123 - cp's OEIS frontend

A258123 Irregular triangle read by rows: T(n,k) is the number of trees with n vertices that have k vertices of maximum degree (n, k>=1).

n	a(n)
1	1
2	0
3	1
4	1
5	1
6	1
7	2
8	0
9	1
10	4
11	1
12	0
13	1
14	8
15	2
16	0
17	0
18	1
19	15
20	6
21	1
22	0
23	0
24	1
25	32
26	11
27	3
28	0
29	0
30	0
31	1
32	68
33	25
34	10
35	2
36	0
37	0
38	0
39	1
40	156
41	47
42	25
43	6
44	0
45	0
46	0
47	0
48	1
49	361
50	105
51	58
52	24
53	2
54	0
55	0
56	0
57	0
58	1
59	869
60	227
61	124
62	69
63	11
64	0
65	0
66	0
67	0
68	0
69	1
70	2105
71	556
72	256
73	185
74	52
75	4
76	0
77	0
78	0
79	0
80	0
81	1

[1, 0, 1, 1, 1, 1, 2, 0, 1, 4, 1, 0, 1, 8, 2, 0, 0, 1, 15, 6, 1, 0, 0, 1, 32, 11, 3, 0, 0, 0, 1, 68, 25, 10, 2, 0, 0, 0, 1, 156, 47, 25, 6, 0, 0, 0, 0, 1, 361, 105, 58, 24, 2, 0, 0, 0, 0, 1, 869, 227, 124, 69, 11, 0, 0, 0, 0, 0, 1, 2105, 556, 256, 185, 52, 4, 0, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A258123 Irregular triangle read by rows: T(n,k) is the number of trees with n vertices that have k vertices of maximum degree (n, k>=1).

Table of values

List of values