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.

A202036 Smallest 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 2
6 3
7 2
8 0
9 0
10 5
11 2
12 0
13 2
14 2
15 2
16 0
17 2
18 0
19 2
20 5
21 7
22 3
23 2
24 0
25 7
26 3
27 0
28 0
29 2
30 19
31 2
32 0
33 2
34 2
35 2
36 0
37 2
38 5
39 5
40 0
41 2
42 7
43 2
44 5
45 17
46 2
47 2
48 0
49 19
50 0
51 2
52 13
53 2
54 0
55 11
56 0
57 7
58 5
59 2
60 0
61 2
62 2
63 0
64 0
65 2
66 3
67 2
68 13
69 2
70 11
71 2
72 0
73 2
74 3
75 7
76 5
77 2
78 13
79 2
80 0
81 0
82 2
83 2
84 0

List of values

[0, 0, 2, 0, 2, 3, 2, 0, 0, 5, 2, 0, 2, 2, 2, 0, 2, 0, 2, 5, 7, 3, 2, 0, 7, 3, 0, 0, 2, 19, 2, 0, 2, 2, 2, 0, 2, 5, 5, 0, 2, 7, 2, 5, 17, 2, 2, 0, 19, 0, 2, 13, 2, 0, 11, 0, 7, 5, 2, 0, 2, 2, 0, 0, 2, 3, 2, 13, 2, 11, 2, 0, 2, 3, 7, 5, 2, 13, 2, 0, 0, 2, 2, 0]

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

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