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.

A072618 Numbers n for which the prime circle problem has a simple solution: the arrangement of numbers 1 through 2n around a circle is such that the sum of each pair of adjacent numbers is prime and the odd and even numbers are in order in opposite directions.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 9
10 12
11 13
12 14
13 15
14 18
15 19
16 20
17 21
18 24
19 27
20 28
21 29
22 30
23 33
24 34
25 35
26 36
27 39
28 42
29 45
30 48
31 49
32 50
33 51
34 52
35 53
36 54
37 60
38 63
39 66
40 67
41 68
42 69
43 72
44 73
45 74
46 75
47 78
48 81
49 84
50 87
51 88
52 89
53 90
54 93
55 94
56 95
57 96
58 97
59 98
60 99
61 102
62 105
63 108
64 111
65 112
66 113
67 114
68 117
69 118

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 18, 19, 20, 21, 24, 27, 28, 29, 30, 33, 34, 35, 36, 39, 42, 45, 48, 49, 50, 51, 52, 53, 54, 60, 63, 66, 67, 68, 69, 72, 73, 74, 75, 78, 81, 84, 87, 88, 89, 90, 93, 94, 95, 96, 97, 98, 99, 102, 105, 108, 111, 112, 113, 114, 117, 118]