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.

A211204 a(1) = 2; for n > 1, a(n) > a(n-1) is the smallest prime for which the set {a(1), a(2), ..., a(n)} lacks at least one residue modulo every odd prime less than or equal to a(n).

Table of values

n a(n)
1 2
2 3
3 5
4 11
5 17
6 23
7 41
8 47
9 53
10 71
11 83
12 101
13 107
14 113
15 131
16 137
17 167
18 173
19 191
20 197
21 233
22 251
23 257
24 263
25 311
26 317
27 347
28 353
29 401
30 431
31 443
32 461
33 467
34 503
35 521
36 563
37 593
38 641
39 647
40 653
41 677
42 683
43 701
44 743
45 761
46 773
47 797
48 827
49 857
50 863
51 881
52 911
53 941
54 947
55 971

List of values

[2, 3, 5, 11, 17, 23, 41, 47, 53, 71, 83, 101, 107, 113, 131, 137, 167, 173, 191, 197, 233, 251, 257, 263, 311, 317, 347, 353, 401, 431, 443, 461, 467, 503, 521, 563, 593, 641, 647, 653, 677, 683, 701, 743, 761, 773, 797, 827, 857, 863, 881, 911, 941, 947, 971]