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.

A191677 Numbers n such that 1^(n-1)+2^(n-1)+...+n^(n-1) == 0 (mod n).

Table of values

n a(n)
1 1
2 4
3 8
4 12
5 16
6 20
7 24
8 28
9 32
10 35
11 36
12 40
13 44
14 48
15 52
16 55
17 56
18 60
19 64
20 68
21 72
22 76
23 77
24 80
25 84
26 88
27 92
28 95
29 96
30 100
31 104
32 108
33 112
34 115
35 116
36 119
37 120
38 124
39 128
40 132
41 136
42 140
43 143
44 144
45 148
46 152
47 155
48 156
49 160
50 161
51 164
52 168
53 172
54 176
55 180
56 184
57 187
58 188
59 192
60 196
61 200
62 203
63 204

List of values

[1, 4, 8, 12, 16, 20, 24, 28, 32, 35, 36, 40, 44, 48, 52, 55, 56, 60, 64, 68, 72, 76, 77, 80, 84, 88, 92, 95, 96, 100, 104, 108, 112, 115, 116, 119, 120, 124, 128, 132, 136, 140, 143, 144, 148, 152, 155, 156, 160, 161, 164, 168, 172, 176, 180, 184, 187, 188, 192, 196, 200, 203, 204]