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.

A091430 Number of Hamiltonian symmetric trivalent (or cubic) connected graphs on 2n nodes (the Foster census).

Table of values

n a(n)
1 0
2 1
3 1
4 1
5 0
6 0
7 1
8 1
9 1
10 2
11 0
12 1
13 1
14 0
15 1
16 1
17 0
18 0
19 1
20 1
21 1
22 0
23 0
24 1
25 1
26 0
27 1
28 3
29 0
30 1
31 1
32 1
33 0
34 0
35 0
36 1
37 1
38 0
39 1
40 1
41 0
42 1
43 1
44 0
45 1
46 0
47 0
48 2
49 2
50 0
51 1
52 1
53 0
54 1
55 1
56 3
57 1
58 0
59 0
60 2
61 1
62 0
63 1
64 2
65 0
66 0
67 1
68 0
69 0
70 0
71 0
72 2
73 1
74 0
75 1
76 1
77 0
78 0
79 1
80 0
81 3
82 0
83 0
84 6
85 0
86 0
87 0
88 0
89 0
90 0
91 4
92 0
93 1
94 0
95 0
96 3
97 1
98 0
99 0
100 1
101 0
102 1
103 1
104 1
105 0
106 0
107 0
108 3
109 1
110 3
111 1
112 3
113 0
114 0
115 0
116 0
117 2
118 0
119 0
120 3
121 1
122 0
123 0
124 1
125 1
126 0
127 1
128 4
129 1
130 0
131 0
132 0
133 2
134 0
135 0
136 0
137 0
138 0
139 1
140 0
141 0
142 0
143 0
144 2
145 0
146 0
147 2
148 1
149 0
150 0
151 1

List of values

[0, 1, 1, 1, 0, 0, 1, 1, 1, 2, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 3, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 0, 2, 2, 0, 1, 1, 0, 1, 1, 3, 1, 0, 0, 2, 1, 0, 1, 2, 0, 0, 1, 0, 0, 0, 0, 2, 1, 0, 1, 1, 0, 0, 1, 0, 3, 0, 0, 6, 0, 0, 0, 0, 0, 0, 4, 0, 1, 0, 0, 3, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 3, 1, 3, 1, 3, 0, 0, 0, 0, 2, 0, 0, 3, 1, 0, 0, 1, 1, 0, 1, 4, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 2, 0, 0, 2, 1, 0, 0, 1]