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.

A367688 Number of primes p such that x^n + y^n mod p does not take all values on Z/pZ.

Table of values

n a(n)
1 0
2 0
3 1
4 4
5 4
6 13
7 5
8 14
9 11
10 24
11 9
12 42
13 14
14 30
15 26
16 37
17 17
18 54
19 17
20 63
21 33
22 43
23 25
24 104
25 31
26 53
27 49
28 87
29 26
30 130
31 27
32 85
33 56
34 69
35 56
36 170
37 36
38 74
39 68
40 140
41 40
42 175
43 43
44 124
45 105
46 91
47 45
48 215
49 55
50 149
51 87
52 142
53 48
54 209
55 83
56 185
57 96
58 119
59 57
60 339
61 59
62 128
63 133

List of values

[0, 0, 1, 4, 4, 13, 5, 14, 11, 24, 9, 42, 14, 30, 26, 37, 17, 54, 17, 63, 33, 43, 25, 104, 31, 53, 49, 87, 26, 130, 27, 85, 56, 69, 56, 170, 36, 74, 68, 140, 40, 175, 43, 124, 105, 91, 45, 215, 55, 149, 87, 142, 48, 209, 83, 185, 96, 119, 57, 339, 59, 128, 133]

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

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