A331437 - cp's OEIS frontend

A331437 Triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n edges and k vertices, n >= 0, 1 <= k <= n+1.

n	a(n)
0	1
1	0
2	1
3	0
4	0
5	0
6	0
7	0
8	0
9	4
10	0
11	0
12	0
13	0
14	5
15	0
16	0
17	0
18	0
19	0
20	96
21	0
22	0
23	0
24	1
25	0
26	120
27	427
28	0
29	0
30	0
31	0
32	20
33	180
34	1260
35	6448
36	0
37	0
38	0
39	0
40	15
41	420
42	3780
43	23520
44	56961
45	0
46	0
47	0
48	0
49	10
50	700
51	10850
52	79800
53	347760
54	892720
55	0
56	0
57	0
58	0
59	1
60	837
61	24045
62	269360
63	1655640
64	6400800
65	11905091

[1, 0, 1, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 96, 0, 0, 0, 1, 0, 120, 427, 0, 0, 0, 0, 20, 180, 1260, 6448, 0, 0, 0, 0, 15, 420, 3780, 23520, 56961, 0, 0, 0, 0, 10, 700, 10850, 79800, 347760, 892720, 0, 0, 0, 0, 1, 837, 24045, 269360, 1655640, 6400800, 11905091]

cp's OEIS Frontend

A331437 Triangle read by rows: T(n,k) = number of homeomorphically irreducible connected labeled graphs with n edges and k vertices, n >= 0, 1 <= k <= n+1.

Table of values

List of values