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.

A321575 Nexus primary pretenders: a(n) is the smallest composite k such that n^k - (n-1)^k == 1 (mod k).

Table of values

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

List of values

[9, 4, 341, 4, 6, 4, 9, 4, 14, 4, 6, 4, 9, 4, 21, 4, 6, 4, 9, 4, 15, 4, 6, 4, 9, 4, 10, 4, 6, 4, 9, 4, 62, 4, 6, 4, 9, 4, 49, 4, 6, 4, 9, 4, 33, 4, 6, 4, 9, 4, 14, 4, 6, 4, 9, 4, 10, 4, 6, 4, 9, 4, 65, 4, 6, 4, 9, 4, 49, 4, 6, 4, 9, 4, 111, 4, 6, 4, 9, 4, 15]

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

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