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.

A226872 1 together with even numbers n >= 2 such that 1^n + 2^n + 3^n + ... + n^n == n/2 (mod n).

Table of values

n a(n)
1 1
2 2
3 4
4 8
5 10
6 14
7 16
8 22
9 26
10 28
11 32
12 34
13 38
14 44
15 46
16 50
17 52
18 56
19 58
20 62
21 64
22 68
23 70
24 74
25 76
26 82
27 86
28 88
29 92
30 94
31 98
32 104
33 106
34 112
35 116
36 118
37 122
38 124
39 128
40 130
41 134
42 136
43 142
44 146
45 148
46 152
47 154
48 158
49 164
50 166
51 170
52 172
53 176
54 178
55 182
56 184
57 188
58 190
59 194
60 196

List of values

[1, 2, 4, 8, 10, 14, 16, 22, 26, 28, 32, 34, 38, 44, 46, 50, 52, 56, 58, 62, 64, 68, 70, 74, 76, 82, 86, 88, 92, 94, 98, 104, 106, 112, 116, 118, 122, 124, 128, 130, 134, 136, 142, 146, 148, 152, 154, 158, 164, 166, 170, 172, 176, 178, 182, 184, 188, 190, 194, 196]