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.

A254444 Largest k such that p = prime(n) satisfies b^(p-1) == 1 (mod p^k) for some base b with 1 < b < p.

Table of values

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

List of values

[1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 3, 2, 2, 2, 1, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 1, 2, 1, 2, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 1, 2, 2, 1, 2, 1]