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.

A108500 Number of values of k (1<=k<=n) where k^(n+1) != k mod n, or equivalently where sum_i{1<=i<=n} k^i != 0 mod n.

Table of values

n a(n)
1 0
2 0
3 1
4 1
5 3
6 0
7 5
8 3
9 5
10 4
11 9
12 3
13 11
14 8
15 11
16 7
17 15
18 4
19 17
20 5
21 13
22 16
23 21
24 9
25 19
26 20
27 17
28 19
29 27
30 12
31 29
32 15
33 29
34 28
35 31
36 15
37 35
38 32
39 31
40 15
41 39
42 0
43 41
44 35
45 37
46 40
47 45
48 21
49 41
50 28
51 47
52 37
53 51
54 16
55 43
56 41
57 49
58 52
59 57
60 15
61 59
62 56
63 47
64 31
65 61
66 48
67 65
68 53
69 65
70 52
71 69
72 37
73 71
74 68
75 63
76 67

List of values

[0, 0, 1, 1, 3, 0, 5, 3, 5, 4, 9, 3, 11, 8, 11, 7, 15, 4, 17, 5, 13, 16, 21, 9, 19, 20, 17, 19, 27, 12, 29, 15, 29, 28, 31, 15, 35, 32, 31, 15, 39, 0, 41, 35, 37, 40, 45, 21, 41, 28, 47, 37, 51, 16, 43, 41, 49, 52, 57, 15, 59, 56, 47, 31, 61, 48, 65, 53, 65, 52, 69, 37, 71, 68, 63, 67]