cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A186714 Triangular array C(n, k) = number of connected k-regular graphs, having girth at least 4, with n nodes, 0 <= k <= n div 2.

Table of values

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

List of values

[1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 2, 1, 0, 0, 1, 0, 0, 0, 0, 1, 6, 2, 1, 0, 0, 1, 0, 2, 0, 0, 0, 1, 22, 12, 1, 1, 0, 0, 1, 0, 31, 0, 0, 0, 0, 1, 110, 220, 7, 1, 1, 0, 0, 1, 0, 1606, 0, 1, 0, 0, 0, 1, 792, 16828, 388, 9, 1, 1, 0, 0, 1, 0, 193900, 0, 6, 0, 0, 0, 0, 1]