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.

A069793 Find smallest k such that prime(k) and prime(n+k) use the same digits; sequence gives prime(k).

Table of values

n a(n)
0 2
1 1913
2 113
3 79
4 179
5 13
6 337
7 137
8 1039
9 37
10 139
11 619
12 1031
13 17
14 1123
15 349
16 563
17 3617
18 1213
19 1193
20 839
21 1129
22 617
23 1597
24 2153
25 1021
26 173
27 127
28 571
29 241
30 3037
31 3361
32 131
33 137
34 113
35 2141
36 359
37 1361
38 1471
39 1031
40 1367
41 587
42 1013
43 6337
44 251
45 2153
46 149
47 1049

List of values

[2, 1913, 113, 79, 179, 13, 337, 137, 1039, 37, 139, 619, 1031, 17, 1123, 349, 563, 3617, 1213, 1193, 839, 1129, 617, 1597, 2153, 1021, 173, 127, 571, 241, 3037, 3361, 131, 137, 113, 2141, 359, 1361, 1471, 1031, 1367, 587, 1013, 6337, 251, 2153, 149, 1049]