A360880 - cp's OEIS frontend

A360880 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) multigraphs with n edges and k nodes, loops allowed, n >= 1, 2 <= k <= n + 1.

n	a(n)
1	1
2	2
3	0
4	4
5	1
6	0
7	6
8	2
9	1
10	0
11	9
12	6
13	3
14	1
15	0
16	12
17	14
18	13
19	4
20	1
21	0
22	16
23	28
24	39
25	22
26	5
27	1
28	0
29	20
30	52
31	112
32	98
33	39
34	6
35	1
36	0
37	25
38	93
39	281
40	383
41	236
42	63
43	8
44	1
45	0
46	30
47	152
48	655
49	1304
50	1220
51	515
52	102
53	9
54	1
55	0
56	36
57	242
58	1408
59	3980
60	5418
61	3512
62	1077
63	153
64	11
65	1
66	0

[1, 2, 0, 4, 1, 0, 6, 2, 1, 0, 9, 6, 3, 1, 0, 12, 14, 13, 4, 1, 0, 16, 28, 39, 22, 5, 1, 0, 20, 52, 112, 98, 39, 6, 1, 0, 25, 93, 281, 383, 236, 63, 8, 1, 0, 30, 152, 655, 1304, 1220, 515, 102, 9, 1, 0, 36, 242, 1408, 3980, 5418, 3512, 1077, 153, 11, 1, 0]

cp's OEIS Frontend

A360880 Triangle read by rows: T(n,k) is the number of unlabeled nonseparable (or 2-connected) multigraphs with n edges and k nodes, loops allowed, n >= 1, 2 <= k <= n + 1.

Table of values

List of values