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.

A102566 a(n) = {minimal k such that f^k(prime(n)) = 1} where f(m) = (m+1)/2^r, 2^r is the highest power of two dividing m+1.

Table of values

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

List of values

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