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.

A321576 a(n) is the smallest b > 1 such that b^n - (b-1)^n has all divisors d == 1 (mod n).

Table of values

n a(n)
1 2
2 2
3 2
4 3
5 2
6 4
7 2
8 45
9 3
10 6
11 2
12 301
13 2
14 15
15 10
16 121
17 2
18 64
19 2
20 2101
21 7
22 12
23 2
24 1900081
25 6
26 27
27 18
28 225
29 2
30 9241
31 2
32 31825
33 12
34 52
35 31
36 537850405
37 2
38 96
39 26
40 13568281
41 2
42 232
43 2
44 35421
45 486
46 24
47 2
48 4164776161
49 7
50 2101
51 68
52 10765
53 2
54 145180
55 1925

List of values

[2, 2, 2, 3, 2, 4, 2, 45, 3, 6, 2, 301, 2, 15, 10, 121, 2, 64, 2, 2101, 7, 12, 2, 1900081, 6, 27, 18, 225, 2, 9241, 2, 31825, 12, 52, 31, 537850405, 2, 96, 26, 13568281, 2, 232, 2, 35421, 486, 24, 2, 4164776161, 7, 2101, 68, 10765, 2, 145180, 1925]

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

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