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.

A367689 Smallest prime number p such that x^n + y^n mod p does not take all values on Z/pZ.

Table of values

n a(n)
3 7
4 5
5 11
6 7
7 29
8 5
9 7
10 11
11 23
12 5
13 53
14 29
15 7
16 5
17 103
18 7
19 191
20 5
21 7
22 23
23 47
24 5
25 11
26 53
27 7
28 5
29 59
30 7
31 311
32 5
33 7
34 103
35 11
36 5
37 149
38 191
39 7
40 5
41 83
42 7
43 173
44 5
45 7
46 47
47 283
48 5
49 29
50 11
51 7
52 5
53 107
54 7
55 11
56 5
57 7
58 59
59 709
60 5
61 367
62 311
63 7
64 5
65 11
66 7
67 269
68 5
69 7
70 11
71 569
72 5
73 293
74 149
75 7
76 5
77 23
78 7
79 317
80 5

List of values

[7, 5, 11, 7, 29, 5, 7, 11, 23, 5, 53, 29, 7, 5, 103, 7, 191, 5, 7, 23, 47, 5, 11, 53, 7, 5, 59, 7, 311, 5, 7, 103, 11, 5, 149, 191, 7, 5, 83, 7, 173, 5, 7, 47, 283, 5, 29, 11, 7, 5, 107, 7, 11, 5, 7, 59, 709, 5, 367, 311, 7, 5, 11, 7, 269, 5, 7, 11, 569, 5, 293, 149, 7, 5, 23, 7, 317, 5]

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

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