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.

A228626 Number of Hamiltonian cycles in the undirected simple graph G_n with vertices 1,...,n which has an edge connecting vertices i and j if and only if |i-j| is prime.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 1
6 2
7 4
8 16
9 60
10 186
11 433
12 2215
13 11788
14 76539
15 414240
16 2202215
17 9655287
18 69748712
19 444195809
20 3703859949
21 26688275292
22 201673532931
23 1265944917365
24 11801735916539
25 92511897525830
26 753795624276096
27 5237677221537738
28 41074291450736424
29 280906738160126067

List of values

[0, 0, 0, 0, 1, 2, 4, 16, 60, 186, 433, 2215, 11788, 76539, 414240, 2202215, 9655287, 69748712, 444195809, 3703859949, 26688275292, 201673532931, 1265944917365, 11801735916539, 92511897525830, 753795624276096, 5237677221537738, 41074291450736424, 280906738160126067]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.