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.

A340281 a(n) is the smallest prime p such that the number of distinct values of the ratio (number of nonnegative m < p such that m^k == m (mod p))/(number of nonnegative m < p such that -m^k == m (mod p)) is equal to n for some nonnegative k.

Table of values

n a(n)
1 2
2 3
3 7
4 19
5 31
6 163
7 127
8 1459
9 211
10 883
11 811
12 472393
13 631
14 8503057
15 32077
16 4051
17 2311
18 86093443
19 4951
20 6347497291777
21 10531
22 36451
23 1299079
24 251048476873
25 8191
26 388963
27 5314411
28 22051
29 51031
30 596046447753906250001
31 28351
32 411782264189299
33 24571
34 5904901

List of values

[2, 3, 7, 19, 31, 163, 127, 1459, 211, 883, 811, 472393, 631, 8503057, 32077, 4051, 2311, 86093443, 4951, 6347497291777, 10531, 36451, 1299079, 251048476873, 8191, 388963, 5314411, 22051, 51031, 596046447753906250001, 28351, 411782264189299, 24571, 5904901]