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.

A241504 a(n) = |{0 < g < prime(n): g is not only a primitive root modulo prime(n) but also a partition number given by A000041}|.

Table of values

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

List of values

[1, 1, 2, 2, 2, 3, 4, 3, 4, 4, 3, 4, 5, 3, 5, 4, 5, 3, 3, 5, 4, 4, 6, 5, 4, 6, 4, 6, 4, 3, 4, 4, 3, 7, 8, 5, 3, 6, 5, 8, 5, 2, 5, 7, 7, 6, 4, 7, 7, 2, 7, 5, 3, 6, 6, 10, 9, 5, 8, 7, 5, 10, 5, 5, 3, 8, 5, 5, 9, 4, 5, 5, 5, 8, 7, 10, 9, 6, 7, 4]