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.

A070309 Number of solutions 2<=x<=A060679(n) to the equation x^A060679(n)==1 (mod A060679(n)) where A060679(n) are the orders of non-cyclic groups.

Table of values

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

List of values

[1, 1, 3, 2, 1, 3, 1, 7, 5, 7, 2, 1, 7, 4, 1, 8, 3, 3, 15, 1, 11, 1, 2, 15, 11, 3, 2, 1, 15, 6, 9, 7, 17, 4, 7, 2, 1, 15, 1, 8, 31, 3, 7, 3, 23, 1, 4, 3, 11, 31, 26, 1, 23, 1, 7, 11, 3, 2, 1, 31, 13, 2, 39, 3, 15, 2, 1, 35, 19, 2, 15, 11, 7, 8, 1, 31, 10, 1, 3, 24, 35, 63, 2, 3, 7, 1, 8, 31, 3]