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.

A134204 a(0)=2; for n > 0, a(n) = smallest prime not occurring earlier in the sequence such that a(n-1) + a(n) is a multiple of n. If no such prime exists, the sequence terminates.

Table of values

n a(n)
0 2
1 3
2 5
3 7
4 13
5 17
6 19
7 23
8 41
9 31
10 29
11 37
12 11
13 67
14 59
15 61
16 83
17 53
18 73
19 79
20 101
21 109
22 89
23 233
24 103
25 47
26 239
27 139
28 113
29 293
30 97
31 151
32 137
33 127
34 43
35 167
36 157
37 509
38 251
39 373
40 107
41 467
42 163
43 181
44 347
45 193
46 313
47 439
48 281
49 307
50 443
51 271
52 197
53 227
54 367
55 733
56 331
57 353
58 401
59 71
60 229

List of values

[2, 3, 5, 7, 13, 17, 19, 23, 41, 31, 29, 37, 11, 67, 59, 61, 83, 53, 73, 79, 101, 109, 89, 233, 103, 47, 239, 139, 113, 293, 97, 151, 137, 127, 43, 167, 157, 509, 251, 373, 107, 467, 163, 181, 347, 193, 313, 439, 281, 307, 443, 271, 197, 227, 367, 733, 331, 353, 401, 71, 229]