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.

A200323 For each composite m = A002808(n), a(n) is the smallest number k for which the equation x^m + (x+k)^m = (x+k+1)^m (mod m) has no solution, where x = 0..m-1.

Table of values

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

List of values

[2, 3, 2, 3, 3, 2, 2, 1, 2, 3, 2, 7, 2, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 3, 1, 2, 3, 2, 3, 4, 2, 2, 3, 2, 2, 3, 1, 2, 1, 3, 2, 2, 3, 2, 4, 3, 2, 1, 3, 2, 2, 1, 2, 2, 2, 2, 3, 2, 2, 3, 3, 2, 2, 3, 3, 2, 3, 4, 1, 2, 2, 1, 2, 3, 2, 7, 3, 2, 3, 2, 2, 3, 1, 2, 1, 2]