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.

A115564 Least number d such that 10^n -/+ d form a prime pair.

Table of values

n a(n)
1 3
2 3
3 9
4 69
5 129
6 39
7 261
8 213
9 459
10 33
11 57
12 39
13 267
14 657
15 357
16 1377
17 3
18 387
19 1899
20 393
21 213
22 651
23 3273
24 2733
25 3423
26 1533
27 429
28 603
29 1131
30 1137
31 1113
32 1131
33 249
34 603
35 2979
36 159
37 429
38 921
39 1269
40 2757
41 777
42 789
43 2277
44 11799
45 9
46 5343
47 1821
48 6981
49 23049
50 1623

List of values

[3, 3, 9, 69, 129, 39, 261, 213, 459, 33, 57, 39, 267, 657, 357, 1377, 3, 387, 1899, 393, 213, 651, 3273, 2733, 3423, 1533, 429, 603, 1131, 1137, 1113, 1131, 249, 603, 2979, 159, 429, 921, 1269, 2757, 777, 789, 2277, 11799, 9, 5343, 1821, 6981, 23049, 1623]