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.

A319484 a(n) is the smallest k > 1 such that n^k == n (mod k) and gcd(k, b^k-b) = 1 for some b <> n.

Table of values

n a(n)
0 35
1 35
2 7957
3 16531
4 1247
5 4495
6 35
7 817
8 2501
9 697
10 55
11 55
12 143
13 221
14 35
15 35
16 1247
17 493
18 221
19 95
20 35
21 35
22 77
23 253
24 115
25 403
26 247
27 247
28 203
29 35
30 155
31 155
32 697
33 187
34 35
35 35
36 35
37 589
38 221
39 95
40 533
41 35
42 287
43 77
44 55
45 55
46 115
47 221
48 329
49 35
50 35
51 221
52 221
53 689
54 55
55 35
56 35

List of values

[35, 35, 7957, 16531, 1247, 4495, 35, 817, 2501, 697, 55, 55, 143, 221, 35, 35, 1247, 493, 221, 95, 35, 35, 77, 253, 115, 403, 247, 247, 203, 35, 155, 155, 697, 187, 35, 35, 35, 589, 221, 95, 533, 35, 287, 77, 55, 55, 115, 221, 329, 35, 35, 221, 221, 689, 55, 35, 35]