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.

A208643 Least positive integer m such that those k*(k-1) mod m with k=1,...,n are pairwise distinct.

Table of values

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

List of values

[1, 3, 5, 7, 11, 11, 13, 16, 17, 19, 23, 23, 29, 29, 29, 31, 37, 37, 37, 41, 41, 43, 47, 47, 53, 53, 53, 59, 59, 59, 61, 64, 67, 67, 71, 71, 73, 79, 79, 79, 83, 83, 89, 89, 89, 97, 97, 97, 97, 101, 101, 103, 107, 107, 109, 113, 113, 127, 127, 127]