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.

A016726 Smallest k such that 1, 4, 9, ..., n^2 are distinct mod k.

Table of values

n a(n)
1 1
2 2
3 6
4 9
5 10
6 13
7 14
8 17
9 19
10 22
11 22
12 26
13 26
14 29
15 31
16 34
17 34
18 37
19 38
20 41
21 43
22 46
23 46
24 53
25 53
26 53
27 58
28 58
29 58
30 61
31 62
32 67
33 67
34 71
35 71
36 73
37 74
38 79
39 79
40 82
41 82
42 86
43 86
44 89
45 94
46 94
47 94
48 97
49 101
50 101
51 103
52 106
53 106
54 109
55 113
56 113
57 118
58 118
59 118
60 122
61 122
62 127
63 127
64 131
65 131
66 134

List of values

[1, 2, 6, 9, 10, 13, 14, 17, 19, 22, 22, 26, 26, 29, 31, 34, 34, 37, 38, 41, 43, 46, 46, 53, 53, 53, 58, 58, 58, 61, 62, 67, 67, 71, 71, 73, 74, 79, 79, 82, 82, 86, 86, 89, 94, 94, 94, 97, 101, 101, 103, 106, 106, 109, 113, 113, 118, 118, 118, 122, 122, 127, 127, 131, 131, 134]