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.

A102457 Least k >= 2 with n^(kn) == n (mod kn), also n^(kn-1) == 1 (mod k).

Table of values

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

List of values

[80519, 2, 3, 2, 5, 2, 7, 2, 3, 2, 11, 2, 13, 2, 3, 2, 17, 2, 19, 2, 3, 2, 23, 2, 5, 2, 3, 2, 29, 2, 31, 2, 3, 2, 5, 2, 37, 2, 3, 2, 41, 2, 43, 2, 3, 2, 47, 2, 7, 2, 3, 2, 53, 2, 5, 2, 3, 2, 59, 2, 61, 2, 3, 2, 5, 2, 67, 2, 3, 2, 71, 2, 73, 2, 3, 2, 7, 2, 79, 2, 3, 2, 83, 2, 5, 2, 3, 2, 89, 2, 7, 2, 3]