A185330 - cp's OEIS frontend

A185330 Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth at least g.

n	a(n)
2	1
3	2
4	1
5	6
6	2
7	21
8	6
9	1
10	94
11	23
12	2
13	540
14	112
15	9
16	1
17	4207
18	801
19	49
20	1
21	42110
22	7840
23	455
24	5
25	516344
26	97723
27	5784
28	32
29	7373924
30	1436873
31	90940
32	385
33	118573592
34	23791155
35	1620491
36	7574
37	1
38	2103205738
39	432878091
40	31478651
41	181227
42	3
43	40634185402

[1, 2, 1, 6, 2, 21, 6, 1, 94, 23, 2, 540, 112, 9, 1, 4207, 801, 49, 1, 42110, 7840, 455, 5, 516344, 97723, 5784, 32, 7373924, 1436873, 90940, 385, 118573592, 23791155, 1620491, 7574, 1, 2103205738, 432878091, 31478651, 181227, 3, 40634185402]

cp's OEIS Frontend

A185330 Irregular triangle E(n,g) counting not necessarily connected 3-regular simple graphs on 2n vertices with girth at least g.

Table of values

List of values