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.

A072617 Number of essentially different ways of arranging numbers 1 through 2n around a circle so that the sum of each pair of adjacent numbers is prime, with the odd and even numbers in order in opposite directions.

Table of values

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

List of values

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