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.

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

Table of values

n a(n)
1 2
2 7
3 11
4 13
5 17
6 19
7 23
8 31
9 41
10 43
11 47
12 61
13 71
14 73
15 83
16 97
17 101
18 103
19 107
20 109
21 113
22 127
23 131
24 139
25 149
26 151
27 167
28 181
29 191
30 193
31 197
32 199
33 227
34 229
35 233
36 241
37 251
38 271
39 281
40 283
41 293
42 307
43 311
44 313
45 317
46 331
47 347
48 349
49 353
50 367
51 383
52 397
53 401
54 409
55 419
56 421

List of values

[2, 7, 11, 13, 17, 19, 23, 31, 41, 43, 47, 61, 71, 73, 83, 97, 101, 103, 107, 109, 113, 127, 131, 139, 149, 151, 167, 181, 191, 193, 197, 199, 227, 229, 233, 241, 251, 271, 281, 283, 293, 307, 311, 313, 317, 331, 347, 349, 353, 367, 383, 397, 401, 409, 419, 421]