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.

A175451 a(n)>a(n-1), a(n) = smallest prime such that a(n)+a(n-1) is multiple of m, a(1)=2, m=21.

Table of values

n a(n)
1 2
2 19
3 23
4 61
5 107
6 229
7 233
8 271
9 317
10 397
11 401
12 439
13 443
14 523
15 569
16 607
17 653
18 691
19 821
20 859
21 863
22 1069
23 1283
24 1321
25 1367
26 1447
27 1451
28 1489
29 1493
30 1531
31 1619
32 1657
33 1787
34 1867
35 1871
36 1951
37 1997
38 2161
39 2207
40 2287
41 2333
42 2371
43 2417
44 2539
45 2543
46 2707
47 2711

List of values

[2, 19, 23, 61, 107, 229, 233, 271, 317, 397, 401, 439, 443, 523, 569, 607, 653, 691, 821, 859, 863, 1069, 1283, 1321, 1367, 1447, 1451, 1489, 1493, 1531, 1619, 1657, 1787, 1867, 1871, 1951, 1997, 2161, 2207, 2287, 2333, 2371, 2417, 2539, 2543, 2707, 2711]