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.

A339020 Largest value of (p*q mod n), for primes p and q, where p + q = n and p <= q (or 0 if no such primes exist).

Table of values

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

List of values

[0, 0, 0, 0, 1, 3, 3, 7, 5, 5, 0, 11, 9, 7, 11, 7, 0, 11, 15, 11, 17, 19, 0, 23, 21, 17, 0, 19, 0, 29, 27, 23, 29, 25, 0, 35, 0, 27, 35, 39, 0, 41, 39, 39, 41, 37, 0, 47, 45, 41, 0, 43, 0, 47, 51, 55, 0, 53, 0, 59, 57, 53, 59, 55, 0, 65, 0, 59, 65, 69, 0, 71, 69, 65, 71, 71, 0, 53]