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.

A322120 a(n) is the smallest composite k such that n^(k-1) == 1 (mod (n^2-1)*k).

Table of values

n a(n)
2 341
3 91
4 91
5 217
6 481
7 25
8 65
9 91
10 91
11 133
12 133
13 85
14 781
15 341
16 91
17 91
18 25
19 49
20 671
21 221
22 169
23 91
24 553
25 217
26 133
27 121
28 361
29 341
30 49
31 49
32 25
33 545
34 703
35 341
36 403
37 217
38 85
39 341
40 121
41 671
42 529
43 25
44 703
45 133
46 133
47 65
48 481
49 247
50 793
51 451
52 671
53 703
54 361
55 697
56 403
57 25

List of values

[341, 91, 91, 217, 481, 25, 65, 91, 91, 133, 133, 85, 781, 341, 91, 91, 25, 49, 671, 221, 169, 91, 553, 217, 133, 121, 361, 341, 49, 49, 25, 545, 703, 341, 403, 217, 85, 341, 121, 671, 529, 25, 703, 133, 133, 65, 481, 247, 793, 451, 671, 703, 361, 697, 403, 25]