A186716 - cp's OEIS frontend

A186716 Irregular triangle C(n,k): the number of connected k-regular graphs on n vertices having girth at least six.

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

[1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 5, 0, 0, 1, 0, 0, 0, 1, 32, 0, 0, 1, 0, 0, 0, 1, 385, 0, 0, 1, 0, 0, 0, 1, 7574, 0, 0, 1, 0, 0, 0, 1, 181227, 1, 0, 0, 1, 0, 0, 0, 0, 1]

cp's OEIS Frontend

A186716 Irregular triangle C(n,k): the number of connected k-regular graphs on n vertices having girth at least six.

Table of values

List of values