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.

A208494 Least integer m>1 such that those k! mod m with k=1,...,n are pairwise distinct.

Table of values

n a(n)
1 2
2 2
3 3
4 7
5 10
6 13
7 13
8 13
9 31
10 37
11 37
12 37
13 61
14 61
15 61
16 83
17 83
18 83
19 127
20 127
21 127
22 127
23 127
24 179
25 179
26 179
27 179
28 179
29 193
30 193
31 193
32 193
33 193
34 193
35 193
36 193
37 277
38 277
39 277
40 277
41 277
42 277
43 383
44 383
45 383
46 383
47 383
48 479
49 479
50 479
51 479
52 479
53 479
54 479
55 541
56 541
57 541
58 541
59 541
60 541
61 541
62 541
63 541
64 641
65 641
66 641
67 641
68 641
69 641
70 641
71 641
72 641
73 877
74 877
75 877
76 877
77 877
78 877
79 877
80 877
81 877
82 877
83 877
84 877
85 877
86 877
87 877
88 877
89 877
90 877
91 877
92 877
93 877
94 877
95 877
96 877
97 877
98 877
99 877
100 1013
101 1013
102 1013
103 1013
104 1013
105 1013
106 1013
107 1013
108 1013
109 1013
110 1013

List of values

[2, 2, 3, 7, 10, 13, 13, 13, 31, 37, 37, 37, 61, 61, 61, 83, 83, 83, 127, 127, 127, 127, 127, 179, 179, 179, 179, 179, 193, 193, 193, 193, 193, 193, 193, 193, 277, 277, 277, 277, 277, 277, 383, 383, 383, 383, 383, 479, 479, 479, 479, 479, 479, 479, 541, 541, 541, 541, 541, 541, 541, 541, 541, 641, 641, 641, 641, 641, 641, 641, 641, 641, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 877, 1013, 1013, 1013, 1013, 1013, 1013, 1013, 1013, 1013, 1013, 1013]