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.

A317587 a(n) is the smallest number m > n such that Sum_{k=1..n-1} k^(m-1) == n-1 (mod m).

Table of values

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

List of values

[3, 5, 5, 6, 7, 11, 11, 11, 11, 13, 13, 16, 17, 17, 17, 19, 19, 23, 23, 23, 23, 29, 29, 29, 29, 29, 29, 31, 31, 37, 37, 37, 36, 37, 37, 40, 41, 41, 41, 43, 43, 47, 47, 47, 47, 53, 53, 53, 53, 53, 53, 59, 59, 59, 59, 59, 59, 61, 61, 67, 67, 67, 67, 67, 67, 71, 71, 71, 71]

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

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