A360870 - cp's OEIS frontend

A360870 Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes, no cut-points and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).

n	a(n)
2	1
3	1
4	2
5	1
6	4
7	1
8	7
9	2
10	1
11	10
12	8
13	2
14	1
15	14
16	19
17	11
18	1
19	18
20	40
21	48
22	7
23	1
24	23
25	77
26	154
27	70
28	5
29	1
30	28
31	132
32	421
33	392
34	71
35	1
36	34
37	217
38	1008
39	1638
40	690
41	35
42	1
43	40
44	340
45	2210
46	5623
47	4548
48	767
49	16
50	1
51	47
52	510
53	4477
54	16745
55	22657
56	8594
57	566
58	1
59	54
60	742
61	8557
62	44698
63	92844
64	64716
65	11247
66	226

[1, 1, 2, 1, 4, 1, 7, 2, 1, 10, 8, 2, 1, 14, 19, 11, 1, 18, 40, 48, 7, 1, 23, 77, 154, 70, 5, 1, 28, 132, 421, 392, 71, 1, 34, 217, 1008, 1638, 690, 35, 1, 40, 340, 2210, 5623, 4548, 767, 16, 1, 47, 510, 4477, 16745, 22657, 8594, 566, 1, 54, 742, 8557, 44698, 92844, 64716, 11247, 226]

cp's OEIS Frontend

A360870 Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes, no cut-points and degree >= 3 at each node, loops allowed, n >= 2, 1 <= k <= floor(2*n/3).

Table of values

List of values