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.

A228870 Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n).

Table of values

n a(n)
1 6
2 12
3 18
4 20
5 24
6 30
7 36
8 40
9 42
10 48
11 54
12 60
13 66
14 72
15 78
16 80
17 84
18 90
19 96
20 100
21 102
22 108
23 110
24 114
25 120
26 126
27 132
28 138
29 140
30 144
31 150
32 156
33 160
34 162
35 168
36 174
37 180
38 186
39 192
40 198
41 200
42 204
43 210
44 216
45 220
46 222
47 228
48 234
49 240
50 246
51 252
52 258
53 260
54 264
55 270
56 272

List of values

[6, 12, 18, 20, 24, 30, 36, 40, 42, 48, 54, 60, 66, 72, 78, 80, 84, 90, 96, 100, 102, 108, 110, 114, 120, 126, 132, 138, 140, 144, 150, 156, 160, 162, 168, 174, 180, 186, 192, 198, 200, 204, 210, 216, 220, 222, 228, 234, 240, 246, 252, 258, 260, 264, 270, 272]