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.

A284044 Largest positive k among all primes p < n such that n^(p-1) == 1 (mod p^k).

Table of values

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

List of values

[1, 1, 2, 1, 2, 2, 3, 2, 1, 1, 2, 1, 1, 1, 4, 3, 3, 1, 2, 2, 2, 2, 3, 3, 2, 3, 2, 2, 2, 2, 5, 1, 2, 1, 2, 2, 1, 2, 3, 3, 2, 2, 2, 2, 1, 2, 4, 2, 2, 1, 3, 2, 3, 1, 3, 1, 1, 2, 2, 2, 2, 2, 6, 1, 2, 3, 2, 2, 2, 1, 3, 2, 2, 2, 2, 2, 2, 4, 4, 4, 1, 1, 2, 1, 1, 1, 3]