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.

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

Table of values

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

List of values

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