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.

A359210 Number of m^k == 1 (mod p) for 0 < m,k < p where p is the n-th prime.

Table of values

n a(n)
1 1
2 3
3 8
4 15
5 27
6 40
7 48
8 63
9 63
10 104
11 135
12 168
13 180
14 195
15 135
16 200
17 171
18 360
19 315
20 351
21 420
22 375
23 243
24 420
25 560
26 520
27 495
28 315
29 648
30 624
31 819
32 675
33 660
34 675
35 584
36 975
37 1000
38 891
39 495
40 680
41 531
42 1512
43 999
44 1280
45 1064
46 1323
47 1755
48 1095
49 675
50 1480
51 1140
52 1287

List of values

[1, 3, 8, 15, 27, 40, 48, 63, 63, 104, 135, 168, 180, 195, 135, 200, 171, 360, 315, 351, 420, 375, 243, 420, 560, 520, 495, 315, 648, 624, 819, 675, 660, 675, 584, 975, 1000, 891, 495, 680, 531, 1512, 999, 1280, 1064, 1323, 1755, 1095, 675, 1480, 1140, 1287]