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.

A101595 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 19
11 23
12 37
13 53
14 43
15 41
16 61
17 47
18 71
19 79
20 59
21 89
22 67
23 101
24 73
25 109
26 83
27 127
28 97
29 137
30 103
31 131
32 107
33 139
34 181
35 113
36 151
37 173
38 167
39 149
40 197
41 157
42 211
43 163
44 223
45 179
46 229
47 191
48 257
49 193
50 239
51 307
52 199
53 251
54 277
55 227
56 283
57 241
58 233
59 311

List of values

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