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.

A277859 Least k > 1 such that 1^(k-1) + 2^(k-1) + 3^(k-1) + … + (k-1)^(k-1) - n == 0 (mod k).

Table of values

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

List of values

[2, 3, 2, 4, 2, 7, 2, 3, 2, 11, 2, 4, 2, 3, 2, 4, 2, 19, 2, 3, 2, 23, 2, 4, 2, 3, 2, 4, 2, 31, 2, 3, 2, 5, 2, 4, 2, 3, 2, 4, 2, 9, 2, 3, 2, 47, 2, 4, 2, 3, 2, 4, 2, 5, 2, 3, 2, 59, 2, 4, 2, 3, 2, 4, 2, 45, 2, 3, 2, 15, 2, 4, 2, 3, 2, 4, 2, 9, 2, 3, 2, 83, 2, 4, 2]