A360862 - cp's OEIS frontend

A360862 Triangle read by rows: T(n,k) is the number of unlabeled connected multigraphs with n edges on k nodes 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	5
10	1
11	10
12	20
13	5
14	1
15	14
16	48
17	36
18	1
19	18
20	99
21	153
22	30
23	1
24	23
25	181
26	481
27	277
28	17
29	1
30	28
31	303
32	1239
33	1451
34	323
35	1
36	34
37	479
38	2811
39	5572
40	2946
41	193
42	1
43	40
44	726
45	5805
46	17607
47	17343
48	3806
49	71
50	1
51	47
52	1055
53	11148
54	48401
55	77708
56	36872
57	3188
58	1
59	54
60	1492
61	20219
62	120018
63	288476
64	243007
65	54386
66	1496

[1, 1, 2, 1, 4, 1, 7, 5, 1, 10, 20, 5, 1, 14, 48, 36, 1, 18, 99, 153, 30, 1, 23, 181, 481, 277, 17, 1, 28, 303, 1239, 1451, 323, 1, 34, 479, 2811, 5572, 2946, 193, 1, 40, 726, 5805, 17607, 17343, 3806, 71, 1, 47, 1055, 11148, 48401, 77708, 36872, 3188, 1, 54, 1492, 20219, 120018, 288476, 243007, 54386, 1496]

cp's OEIS Frontend

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

Table of values

List of values