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.

A227828 a(0)=2; for n>0, a(n) is the smallest (odd or even) prime p such that the n-th prime p_n divides a(n-1)+p.

Table of values

n a(n)
0 2
1 2
2 7
3 3
4 11
5 11
6 2
7 83
8 31
9 61
10 113
11 11
12 137
13 109
14 149
15 227
16 197
17 157
18 331
19 71
20 71
21 2
22 709
23 619
24 271
25 311
26 1103
27 751
28 2459
29 157
30 521
31 241
32 283
33 1087
34 859
35 631
36 577
37 1307
38 1301
39 2039
40 37
41 1753
42 419
43 727
44 431
45 751
46 443
47 401
48 491
49 2687
50 61

List of values

[2, 2, 7, 3, 11, 11, 2, 83, 31, 61, 113, 11, 137, 109, 149, 227, 197, 157, 331, 71, 71, 2, 709, 619, 271, 311, 1103, 751, 2459, 157, 521, 241, 283, 1087, 859, 631, 577, 1307, 1301, 2039, 37, 1753, 419, 727, 431, 751, 443, 401, 491, 2687, 61]