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.

A317357 a(n) is the smallest composite k > n such that 1^(k-1) + 2^(k-1) + ... + n^(k-1) == n (mod k).

Table of values

n a(n)
1 4
2 341
3 473
4 6
5 10
6 133
7 497
8 14
9 12
10 15
11 15
12 16
13 18
14 143
15 35
16 20
17 32
18 51
19 57
20 38
21 28
22 77
23 253
24 36
25 30
26 65
27 39
28 36
29 58
30 115
31 155
32 62
33 36
34 187
35 119
36 40
37 74
38 57
39 247
40 52
41 80
42 287
43 2051
44 86
45 55
46 69
47 69
48 94
49 54
50 175
51 85
52 65
53 65
54 159
55 69
56 70
57 64
58 551
59 1711
60 72

List of values

[4, 341, 473, 6, 10, 133, 497, 14, 12, 15, 15, 16, 18, 143, 35, 20, 32, 51, 57, 38, 28, 77, 253, 36, 30, 65, 39, 36, 58, 115, 155, 62, 36, 187, 119, 40, 74, 57, 247, 52, 80, 287, 2051, 86, 55, 69, 69, 94, 54, 175, 85, 65, 65, 159, 69, 70, 64, 551, 1711, 72]