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.

A280187 Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) is not 0 (mod n), but 2 * (1^d + 2^d + 3^d + ... + d^d) is 0 (mod d) for each other d | n.

Table of values

n a(n)
1 6
2 20
3 110
4 272
5 506
6 812
7 2162
8 2756
9 3422
10 4970
11 6806
12 7832
13 11342
14 12656
15 17030
16 18632
17 22052
18 27722
19 29756
20 31862
21 36290
22 38612
23 51302
24 54056
25 56882
26 62750
27 65792
28 68906
29 72092
30 85556
31 96410
32 100172
33 120062
34 124256
35 128522

List of values

[6, 20, 110, 272, 506, 812, 2162, 2756, 3422, 4970, 6806, 7832, 11342, 12656, 17030, 18632, 22052, 27722, 29756, 31862, 36290, 38612, 51302, 54056, 56882, 62750, 65792, 68906, 72092, 85556, 96410, 100172, 120062, 124256, 128522]