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.

A020498 a(n) is the least number > a(n-1) such that there is no prime p for which a(1) through a(n) would contain all residues modulo p.

Table of values

n a(n)
1 1
2 3
3 7
4 9
5 13
6 19
7 21
8 27
9 31
10 33
11 37
12 43
13 49
14 51
15 57
16 63
17 69
18 73
19 79
20 87
21 91
22 97
23 99
24 103
25 111
26 117
27 121
28 129
29 133
30 139
31 141
32 147
33 153
34 157
35 159
36 163
37 169
38 177
39 183
40 187
41 189
42 199
43 201
44 211
45 213
46 217
47 231
48 241
49 243
50 247
51 253
52 261
53 267
54 271
55 273
56 279
57 283
58 289

List of values

[1, 3, 7, 9, 13, 19, 21, 27, 31, 33, 37, 43, 49, 51, 57, 63, 69, 73, 79, 87, 91, 97, 99, 103, 111, 117, 121, 129, 133, 139, 141, 147, 153, 157, 159, 163, 169, 177, 183, 187, 189, 199, 201, 211, 213, 217, 231, 241, 243, 247, 253, 261, 267, 271, 273, 279, 283, 289]