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.

A259111 a(n) = least number k > 1 such that 1^k + 2^k + ... + k^k == n (mod k).

Table of values

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

List of values

[2, 4, 2, 8, 2, 3, 2, 16, 2, 4, 2, 3, 2, 4, 2, 32, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 7, 2, 3, 2, 64, 2, 4, 2, 3, 2, 4, 2, 5, 2, 3, 2, 8, 2, 4, 2, 3, 2, 4, 2, 8, 2, 3, 2, 7, 2, 4, 2, 3, 2, 4, 2, 128, 2, 3, 2, 8, 2, 4, 2, 3, 2, 4, 2, 8, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 11, 2, 3, 2, 8, 2, 4, 2, 3, 2, 4, 2, 5]