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.

A084331 a(1) = 2; a(n+1) is the least prime p not already used such that |p-a(n)| is not equal to |a(k+1)-a(k)| for any k < n.

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 7
6 17
7 29
8 13
9 31
10 23
11 37
12 59
13 19
14 43
15 71
16 41
17 61
18 97
19 47
20 73
21 107
22 53
23 101
24 139
25 67
26 109
27 167
28 79
29 131
30 163
31 83
32 127
33 173
34 89
35 149
36 211
37 103
38 179
39 113
40 181
41 251
42 137
43 193
44 257
45 151
46 229
47 311
48 157
49 269
50 359
51 191
52 277
53 373
54 197
55 271
56 389
57 199
58 293

List of values

[2, 3, 5, 11, 7, 17, 29, 13, 31, 23, 37, 59, 19, 43, 71, 41, 61, 97, 47, 73, 107, 53, 101, 139, 67, 109, 167, 79, 131, 163, 83, 127, 173, 89, 149, 211, 103, 179, 113, 181, 251, 137, 193, 257, 151, 229, 311, 157, 269, 359, 191, 277, 373, 197, 271, 389, 199, 293]