A186715 - cp's OEIS frontend

A186715 Irregular triangle C(n,k)=number of connected k-regular graphs on n vertices having girth at least five.

n	a(n)
1	1
2	0
3	1
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	0
18	0
19	1
20	0
21	0
22	1
23	0
24	0
25	1
26	1
27	0
28	0
29	1
30	0
31	0
32	0
33	1
34	2
35	0
36	0
37	1
38	0
39	0
40	0
41	1
42	9
43	0
44	0
45	1
46	0
47	0
48	0
49	1
50	49
51	0
52	0
53	1
54	0
55	0
56	0
57	1
58	455
59	0
60	0
61	1
62	0
63	1
64	0
65	0
66	1
67	5783
68	2
69	0
70	0
71	1
72	0
73	8
74	0
75	0
76	1
77	90938
78	131
79	0
80	0
81	1
82	0
83	3917
84	0
85	0
86	1
87	1620479
88	123859

[1, 0, 1, 0, 0, 0, 0, 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, 2, 0, 0, 1, 0, 0, 0, 1, 9, 0, 0, 1, 0, 0, 0, 1, 49, 0, 0, 1, 0, 0, 0, 1, 455, 0, 0, 1, 0, 1, 0, 0, 1, 5783, 2, 0, 0, 1, 0, 8, 0, 0, 1, 90938, 131, 0, 0, 1, 0, 3917, 0, 0, 1, 1620479, 123859]

cp's OEIS Frontend

A186715 Irregular triangle C(n,k)=number of connected k-regular graphs on n vertices having girth at least five.

Table of values

List of values