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.

A358242 Consider all invertible residues k mod n. For each such k, find the product of three primes p*q*r = k (mod n) with the smallest max {p, q, r}. Then a(n) is the largest such p over the considered k.

Table of values

n a(n)
1 2
2 3
3 7
4 5
5 11
6 7
7 5
8 7
9 7
10 11
11 7
12 11
13 11
14 11
15 13
16 11
17 13
18 11
19 11
20 13
21 17
22 13
23 13
24 13
25 19
26 17
27 17
28 17
29 13
30 17
31 17
32 17
33 19
34 19
35 29
36 17
37 17
38 13
39 23
40 19
41 23
42 19
43 23
44 17
45 29
46 17
47 23
48 23
49 23
50 19
51 23
52 19
53 23
54 17
55 31
56 23
57 29
58 19
59 29
60 29
61 29
62 19
63 23

List of values

[2, 3, 7, 5, 11, 7, 5, 7, 7, 11, 7, 11, 11, 11, 13, 11, 13, 11, 11, 13, 17, 13, 13, 13, 19, 17, 17, 17, 13, 17, 17, 17, 19, 19, 29, 17, 17, 13, 23, 19, 23, 19, 23, 17, 29, 17, 23, 23, 23, 19, 23, 19, 23, 17, 31, 23, 29, 19, 29, 29, 29, 19, 23]