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.

A257833 Table T(k, n) of smallest bases b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^k), read by antidiagonals.

Table of values

n a(n)
2 5
3 8
4 9
5 7
6 26
7 17
8 18
9 57
10 80
11 33
12 3
13 18
14 182
15 242
16 65
17 19
18 124
19 1047
20 1068
21 728
22 129
23 38
24 239
25 1963
26 1353
27 1068
28 2186
29 257
30 28
31 158
32 239
33 27216
34 34967
35 32318
36 6560
37 513
38 28
39 333
40 4260
41 109193
42 284995
43 82681
44 110443
45 19682
46 1025
47 14
48 42
49 2819
50 15541
51 861642
52 758546
53 2387947
54 280182
55 59048
56 2049

List of values

[5, 8, 9, 7, 26, 17, 18, 57, 80, 33, 3, 18, 182, 242, 65, 19, 124, 1047, 1068, 728, 129, 38, 239, 1963, 1353, 1068, 2186, 257, 28, 158, 239, 27216, 34967, 32318, 6560, 513, 28, 333, 4260, 109193, 284995, 82681, 110443, 19682, 1025, 14, 42, 2819, 15541, 861642, 758546, 2387947, 280182, 59048, 2049]

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

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