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.

A038204 Least k such that factorials have exactly n distinct residues mod k.

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 7
6 11
7 22
8 25
9 55
10 13
11 26
12 17
13 34
14 57
15 76
16 95
17 23
18 46
19 29
20 58
21 31
22 62
23 93
24 155
25 319
26 37
27 74
28 129
29 41
30 82
31 47
32 94
33 141
34 235
35 53
36 106
37 59
38 118
39 71
40 142
41 61
42 67
43 134
44 73
45 146
46 219
47 365
48 511
49 79
50 158
51 237
52 395
53 553
54 1241
55 83
56 166
57 332
58 747
59 89
60 178
61 291
62 485

List of values

[1, 2, 3, 5, 7, 11, 22, 25, 55, 13, 26, 17, 34, 57, 76, 95, 23, 46, 29, 58, 31, 62, 93, 155, 319, 37, 74, 129, 41, 82, 47, 94, 141, 235, 53, 106, 59, 118, 71, 142, 61, 67, 134, 73, 146, 219, 365, 511, 79, 158, 237, 395, 553, 1241, 83, 166, 332, 747, 89, 178, 291, 485]