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.

A075557 a(n) is the smallest odd prime such that (1) a(n) doesn't already appear in the sequence; (2) the n-th partial sum is divisible by n; and (3) the n-th partial sum is relatively prime to n+1.

Table of values

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

List of values

[3, 5, 7, 13, 37, 31, 23, 17, 53, 11, 251, 29, 79, 43, 73, 61, 97, 67, 107, 173, 59, 103, 199, 163, 71, 149, 47, 101, 509, 89, 151, 283, 229, 271, 211, 109, 257, 113, 269, 157, 241, 331, 83, 389, 41, 313, 1543, 19, 307, 463, 373, 277, 811, 457, 137, 191, 419, 311, 197]