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.

A134207 a(0) = 2; for n > 0, a(n) = the smallest prime which is > a(n-1) such that a(n-1) + a(n) is a multiple of n.

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 67
10 73
11 103
12 113
13 173
14 191
15 199
16 233
17 277
18 281
19 479
20 521
21 571
22 617
23 809
24 823
25 827
26 863
27 919
28 929
29 1217
30 1303
31 1487
32 1489
33 1613
34 1753
35 2027
36 2113
37 2179
38 2267
39 2647
40 2713
41 3109
42 3191
43 3259
44 3517
45 3593
46 3767
47 3847
48 3881
49 4057

List of values

[2, 3, 5, 7, 13, 17, 19, 23, 41, 67, 73, 103, 113, 173, 191, 199, 233, 277, 281, 479, 521, 571, 617, 809, 823, 827, 863, 919, 929, 1217, 1303, 1487, 1489, 1613, 1753, 2027, 2113, 2179, 2267, 2647, 2713, 3109, 3191, 3259, 3517, 3593, 3767, 3847, 3881, 4057]