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.

A079666 Least k such that the distance from k^2 to closest prime = n or zero if no k exists.

Table of values

n a(n)
1 1
2 3
3 8
4 17
5 12
6 11
7 18
8 51
9 200
10 59
11 238
12 41
13 276
14 165
15 104
16 281
17 214
18 397
19 348
20 159
21 650
22 305
23 778
24 923
25 2242
26 1155
27 1090
28 911
29 822
30 1871
31 1280
32 1099
33 1516
34 3253
35 2578
36 5849
37 3538
38 693
39 4010
40 1937
41 1284
42 5095
43 3212
44 2011
45 6268
46 6331
47 2160
48 1943
49 12470
50 13443
51 12836
52 7405
53 25428
54 7115
55 22596
56 10873

List of values

[1, 3, 8, 17, 12, 11, 18, 51, 200, 59, 238, 41, 276, 165, 104, 281, 214, 397, 348, 159, 650, 305, 778, 923, 2242, 1155, 1090, 911, 822, 1871, 1280, 1099, 1516, 3253, 2578, 5849, 3538, 693, 4010, 1937, 1284, 5095, 3212, 2011, 6268, 6331, 2160, 1943, 12470, 13443, 12836, 7405, 25428, 7115, 22596, 10873]