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.

A263925 a(n) = least m > 1 such that m + (prime(n)#)^n is prime.

Table of values

n a(n)
1 3
2 5
3 11
4 19
5 89
6 323
7 29
8 61
9 79
10 199
11 563
12 181
13 353
14 1307
15 257
16 709
17 1237
18 1277
19 1609
20 1237
21 4157
22 2017
23 577
24 157
25 191
26 1063
27 239
28 823
29 1607
30 4159
31 139
32 11527
33 2339
34 18457
35 4079
36 463
37 1861
38 1123
39 8699
40 16561
41 719
42 4327
43 9311
44 1693
45 3067
46 4243
47 22397
48 4079
49 3989
50 24071

List of values

[3, 5, 11, 19, 89, 323, 29, 61, 79, 199, 563, 181, 353, 1307, 257, 709, 1237, 1277, 1609, 1237, 4157, 2017, 577, 157, 191, 1063, 239, 823, 1607, 4159, 139, 11527, 2339, 18457, 4079, 463, 1861, 1123, 8699, 16561, 719, 4327, 9311, 1693, 3067, 4243, 22397, 4079, 3989, 24071]