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.

A085013 a(1) = 1; for n>1, a(n) = smallest prime > a(n-1) such that a(1)*...*a(n) + 2 is a prime.

Table of values

n a(n)
1 1
2 3
3 5
4 7
5 13
6 23
7 29
8 37
9 43
10 61
11 73
12 89
13 137
14 151
15 167
16 199
17 269
18 383
19 397
20 521
21 619
22 659
23 739
24 1217
25 1307
26 1613
27 1741
28 1847
29 1873
30 2039
31 2473
32 2521
33 2531
34 3011
35 3391
36 3637
37 3793
38 4201
39 4751
40 5039
41 5879
42 6299
43 7307
44 7829
45 8243
46 8933
47 9781
48 9829
49 10069

List of values

[1, 3, 5, 7, 13, 23, 29, 37, 43, 61, 73, 89, 137, 151, 167, 199, 269, 383, 397, 521, 619, 659, 739, 1217, 1307, 1613, 1741, 1847, 1873, 2039, 2473, 2521, 2531, 3011, 3391, 3637, 3793, 4201, 4751, 5039, 5879, 6299, 7307, 7829, 8243, 8933, 9781, 9829, 10069]