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.

A185103 Smallest k > 1 such that k^(n-1) == 1 (mod n^2).

Table of values

n a(n)
2 5
3 8
4 17
5 7
6 37
7 18
8 65
9 80
10 101
11 3
12 145
13 19
14 197
15 26
16 257
17 38
18 325
19 28
20 401
21 197
22 485
23 28
24 577
25 182
26 677
27 728
28 177
29 14
30 901
31 115
32 1025
33 485
34 1157
35 99
36 1297
37 18
38 1445
39 170
40 1601
41 51
42 1765
43 19
44 1937
45 82
46 2117
47 53
48 2305
49 1047
50 2501
51 577
52 529
53 338
54 2917
55 1451

List of values

[5, 8, 17, 7, 37, 18, 65, 80, 101, 3, 145, 19, 197, 26, 257, 38, 325, 28, 401, 197, 485, 28, 577, 182, 677, 728, 177, 14, 901, 115, 1025, 485, 1157, 99, 1297, 18, 1445, 170, 1601, 51, 1765, 19, 1937, 82, 2117, 53, 2305, 1047, 2501, 577, 529, 338, 2917, 1451]