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.

A242748 Number of ordered ways to write n = k + m with 0 < k <= m such that k is a primitive root modulo prime(k) and m is a primitive root modulo prime(m).

Table of values

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

List of values

[0, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 3, 3, 3, 1, 3, 3, 2, 2, 3, 3, 2, 1, 2, 3, 3, 2, 3, 3, 3, 3, 1, 2, 3, 3, 3, 2, 1, 4, 2, 3, 3, 3, 3, 2, 5, 3, 4, 2, 4, 6, 6, 1, 5, 4, 6, 7, 4, 6, 4, 6, 3, 6, 3, 7, 5, 5, 6, 7, 4, 6, 8, 5, 6, 4, 6, 4, 8, 3, 7]