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.

A202035 Greatest prime residue of x^n (mod n) for x=0..n-1, or 0 if no such prime exists.

Table of values

n a(n)
1 0
2 0
3 2
4 0
5 3
6 3
7 5
8 0
9 0
10 5
11 7
12 0
13 11
14 11
15 13
16 0
17 13
18 0
19 17
20 5
21 13
22 11
23 19
24 0
25 7
26 23
27 0
28 0
29 23
30 19
31 29
32 0
33 31
34 19
35 31
36 0
37 31
38 23
39 31
40 0
41 37
42 7
43 41
44 37
45 37
46 41
47 43
48 0
49 31
50 0
51 47
52 29
53 47
54 0
55 43
56 0
57 37
58 53
59 53
60 0
61 59
62 59
63 0
64 0
65 61
66 37
67 61
68 17
69 67
70 29
71 67
72 0
73 71

List of values

[0, 0, 2, 0, 3, 3, 5, 0, 0, 5, 7, 0, 11, 11, 13, 0, 13, 0, 17, 5, 13, 11, 19, 0, 7, 23, 0, 0, 23, 19, 29, 0, 31, 19, 31, 0, 31, 23, 31, 0, 37, 7, 41, 37, 37, 41, 43, 0, 31, 0, 47, 29, 47, 0, 43, 0, 37, 53, 53, 0, 59, 59, 0, 0, 61, 37, 61, 17, 67, 29, 67, 0, 71]

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

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