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.

A221861 The least number k that maximizes k! mod n.

Table of values

n a(n)
1 0
2 0
3 2
4 2
5 4
6 2
7 3
8 3
9 3
10 3
11 5
12 3
13 12
14 4
15 4
16 4
17 16
18 5
19 9
20 3
21 5
22 6
23 14
24 3
25 4
26 4
27 4
28 4
29 18
30 4
31 30
32 4
33 6
34 9
35 4
36 4
37 36
38 6
39 8
40 4
41 40
42 5
43 21
44 5
45 5
46 10
47 23
48 4
49 7
50 7
51 10
52 7
53 52
54 8
55 9
56 6
57 13
58 7
59 15
60 4
61 8
62 14
63 5
64 5
65 5
66 6
67 18
68 8
69 17
70 5
71 7
72 5
73 72
74 21
75 5
76 14
77 9
78 8
79 23
80 5

List of values

[0, 0, 2, 2, 4, 2, 3, 3, 3, 3, 5, 3, 12, 4, 4, 4, 16, 5, 9, 3, 5, 6, 14, 3, 4, 4, 4, 4, 18, 4, 30, 4, 6, 9, 4, 4, 36, 6, 8, 4, 40, 5, 21, 5, 5, 10, 23, 4, 7, 7, 10, 7, 52, 8, 9, 6, 13, 7, 15, 4, 8, 14, 5, 5, 5, 6, 18, 8, 17, 5, 7, 5, 72, 21, 5, 14, 9, 8, 23, 5]