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.

A228869 Numbers n such that 2 * (1^n + 2^n + 3^n + ... + n^n) == 0 (mod n).

Table of values

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

List of values

[1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 55, 56, 57, 58, 59, 61, 62, 63, 64, 65, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 79, 81, 82, 83]