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.

A094593 a(n) = (p-1)/x, where p = prime(n) and x = ord(3,p), the smallest positive integer such that 3^x == 1 mod p.

Table of values

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

List of values

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