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.

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

Table of values

n a(n)
1 2
2 7
3 11
4 43
5 47
6 61
7 83
8 97
9 101
10 151
11 173
12 223
13 227
14 241
15 263
16 277
17 281
18 313
19 317
20 331
21 353
22 367
23 389
24 421
25 443
26 457
27 461
28 547
29 569
30 601
31 641
32 673
33 677
34 691
35 821
36 853
37 857
38 907
39 911
40 997
41 1019
42 1033
43 1091
44 1123
45 1163
46 1213
47 1217
48 1231
49 1289
50 1303
51 1307

List of values

[2, 7, 11, 43, 47, 61, 83, 97, 101, 151, 173, 223, 227, 241, 263, 277, 281, 313, 317, 331, 353, 367, 389, 421, 443, 457, 461, 547, 569, 601, 641, 673, 677, 691, 821, 853, 857, 907, 911, 997, 1019, 1033, 1091, 1123, 1163, 1213, 1217, 1231, 1289, 1303, 1307]