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.

A337596 Largest m such that k^n (mod m) is always either 0, +1, or -1.

Table of values

n a(n)
1 3
2 5
3 9
4 16
5 11
6 13
7 4
8 32
9 27
10 25
11 23
12 16
13 4
14 29
15 31
16 64
17 4
18 37
19 4
20 41
21 49
22 23
23 47
24 32
25 11
26 53
27 81
28 29
29 59
30 61
31 4
32 128
33 67
34 8
35 71
36 73
37 4
38 8
39 79
40 41
41 83
42 49
43 4
44 89
45 31
46 47
47 4
48 97
49 4
50 125
51 103
52 53
53 107
54 109
55 121
56 113
57 9
58 59
59 4
60 61
61 4
62 8
63 127
64 256
65 131
66 67
67 4
68 137

List of values

[3, 5, 9, 16, 11, 13, 4, 32, 27, 25, 23, 16, 4, 29, 31, 64, 4, 37, 4, 41, 49, 23, 47, 32, 11, 53, 81, 29, 59, 61, 4, 128, 67, 8, 71, 73, 4, 8, 79, 41, 83, 49, 4, 89, 31, 47, 4, 97, 4, 125, 103, 53, 107, 109, 121, 113, 9, 59, 4, 61, 4, 8, 127, 256, 131, 67, 4, 137]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.