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.

A270838 Largest value k < p-2 such that k! mod p = 1 with p = prime(n).

Table of values

n a(n)
3 1
4 1
5 1
6 1
7 11
8 1
9 11
10 10
11 15
12 1
13 1
14 1
15 1
16 37
17 29
18 52
19 48
20 35
21 55
22 1
23 46
24 67
25 53
26 1
27 96
28 53
29 22
30 1
31 1
32 1
33 120
34 122
35 123
36 75
37 1
38 1
39 83
40 1
41 1
42 1
43 1
44 90
45 1
46 117
47 105
48 111
49 82
50 1
51 168
52 119
53 1
54 125
55 1
56 1
57 1
58 135
59 236
60 1
61 141
62 1
63 153
64 281
65 1
66 1
67 231
68 1
69 1
70 1
71 1
72 236

List of values

[1, 1, 1, 1, 11, 1, 11, 10, 15, 1, 1, 1, 1, 37, 29, 52, 48, 35, 55, 1, 46, 67, 53, 1, 96, 53, 22, 1, 1, 1, 120, 122, 123, 75, 1, 1, 83, 1, 1, 1, 1, 90, 1, 117, 105, 111, 82, 1, 168, 119, 1, 125, 1, 1, 1, 135, 236, 1, 141, 1, 153, 281, 1, 1, 231, 1, 1, 1, 1, 236]