A360866 - cp's OEIS frontend

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

n	a(n)
2	0
3	0
4	1
5	0
6	1
7	0
8	1
9	1
10	0
11	1
12	3
13	2
14	0
15	1
16	4
17	7
18	0
19	1
20	6
21	19
22	6
23	0
24	1
25	8
26	40
27	37
28	6
29	0
30	1
31	10
32	71
33	135
34	56
35	0
36	1
37	12
38	117
39	366
40	338
41	35
42	0
43	1
44	15
45	184
46	858
47	1417
48	494
49	20
50	0
51	1
52	17
53	270
54	1778
55	4670
56	3494
57	492
58	0
59	1
60	20
61	387
62	3413
63	13125
64	17355
65	6047
66	251

[0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 3, 2, 0, 1, 4, 7, 0, 1, 6, 19, 6, 0, 1, 8, 40, 37, 6, 0, 1, 10, 71, 135, 56, 0, 1, 12, 117, 366, 338, 35, 0, 1, 15, 184, 858, 1417, 494, 20, 0, 1, 17, 270, 1778, 4670, 3494, 492, 0, 1, 20, 387, 3413, 13125, 17355, 6047, 251]

cp's OEIS Frontend

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

Table of values

List of values