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.

A201560 a(n) = (Sum(m^(n-1), m=1..n-1) + 1) modulo n.

Table of values

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

List of values

[0, 0, 0, 1, 0, 4, 0, 1, 7, 6, 0, 1, 0, 8, 11, 1, 0, 10, 0, 1, 15, 12, 0, 1, 21, 14, 19, 1, 0, 16, 0, 1, 23, 18, 1, 1, 0, 20, 27, 1, 0, 22, 0, 1, 22, 24, 0, 1, 43, 26, 35, 1, 0, 28, 1, 1, 39, 30, 0, 1, 0, 32, 43, 1, 53, 34, 0, 1, 47, 36, 0, 1, 0, 38, 51, 1, 1]