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.

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

Table of values

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

List of values

[0, 1, 2, 0, 0, 3, 0, 0, 6, 5, 0, 0, 0, 7, 7, 0, 0, 9, 0, 0, 14, 11, 0, 0, 0, 13, 18, 0, 0, 15, 0, 0, 22, 17, 23, 0, 0, 19, 26, 0, 0, 21, 0, 0, 30, 23, 0, 0, 0, 25, 34, 0, 0, 27, 44, 0, 38, 29, 0, 0, 0, 31, 42, 0, 0, 33, 0, 0, 46, 35, 0, 0, 0, 37, 35, 0, 66]

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

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