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.

A103147 Least k such that k+n and k-n are both prime but k-m and k+m are not both prime for any 0 <= m < n.

Table of values

n a(n)
0 2
1 4
2 9
3 8
4 27
5 24
6 25
7 54
8 51
9 22
10 117
11 222
12 49
13 114
14 87
15 46
16 207
17 216
18 121
19 258
20 291
21 128
22 591
23 336
24 203
25 306
26 423
27 136
28 519
29 492
30 221
31 888
32 951
33 146
34 537
35 318
36 527
37 1656
38 561
39 238
40 699
41 732
42 265
43 864
44 1365
45 286
46 1353
47 1674
48 341
49 1422
50 1671
51 802
52 2451
53 876
54 553

List of values

[2, 4, 9, 8, 27, 24, 25, 54, 51, 22, 117, 222, 49, 114, 87, 46, 207, 216, 121, 258, 291, 128, 591, 336, 203, 306, 423, 136, 519, 492, 221, 888, 951, 146, 537, 318, 527, 1656, 561, 238, 699, 732, 265, 864, 1365, 286, 1353, 1674, 341, 1422, 1671, 802, 2451, 876, 553]