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.

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

Table of values

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

List of values

[2, 3, 5, 2, 2, 7, 11, 2, 2, 3, 3, 2, 2, 17, 17, 2, 2, 3, 3, 2, 2, 23, 29, 2, 2, 5, 3, 2, 2, 31, 37, 2, 2, 37, 35, 2, 2, 3, 41, 2, 2, 43, 47, 2, 2, 3, 3, 2, 2, 5, 5, 2, 2, 3, 3, 2, 2, 59, 61, 2, 2, 67, 3, 2, 2, 55, 71, 2, 2, 35, 35, 2, 2, 3, 5, 2, 2, 5, 5, 2, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.