A210703 - cp's OEIS frontend

A210703 Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth exactly 3.

n	a(n)
2	0
3	0
4	0
5	0
6	0
7	0
8	0
9	0
10	1
11	0
12	0
13	1
14	0
15	0
16	1
17	1
18	0
19	0
20	2
21	0
22	0
23	0
24	2
25	2
26	1
27	0
28	0
29	3
30	0
31	1
32	0
33	0
34	4
35	8
36	3
37	1
38	0
39	0
40	5
41	0
42	8
43	0
44	0
45	0
46	6
47	29
48	25
49	3
50	1
51	0
52	0
53	9
54	0
55	88
56	0
57	1
58	0
59	0
60	10
61	138
62	377
63	66
64	5
65	1
66	0
67	0
68	13
69	0
70	2026
71	0
72	25
73	0
74	0
75	0
76	17
77	774
78	13349
79	8029
80	297
81	5
82	1
83	0
84	0
85	21
86	0
87	104593
88	0
89	8199
90	0
91	1
92	0
93	0
94	25
95	5678
96	930571
97	3484759
98	377004
99	1562
100	7
101	1

[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 2, 0, 0, 0, 2, 2, 1, 0, 0, 3, 0, 1, 0, 0, 4, 8, 3, 1, 0, 0, 5, 0, 8, 0, 0, 0, 6, 29, 25, 3, 1, 0, 0, 9, 0, 88, 0, 1, 0, 0, 10, 138, 377, 66, 5, 1, 0, 0, 13, 0, 2026, 0, 25, 0, 0, 0, 17, 774, 13349, 8029, 297, 5, 1, 0, 0, 21, 0, 104593, 0, 8199, 0, 1, 0, 0, 25, 5678, 930571, 3484759, 377004, 1562, 7, 1]

cp's OEIS Frontend

A210703 Triangular array D(n,k) counting disconnected k-regular simple graphs on n vertices with girth exactly 3.

Table of values

List of values