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.

A280801 Least k > 0 such that (2*n)^k is in A002202, or 0 if no such k exists.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 4, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 5, 1, 1, 2, 1, 1, 2, 3, 1, 1, 1, 1, 15, 1, 2, 1, 2, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 3, 1, 7, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 1, 3, 3, 1, 8, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 4, 1, 2, 2, 1, 1, 4, 1, 1, 1, 17, 1, 2, 1, 1, 1, 3, 1, 3, 1, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 2, 5, 2, 2, 1, 1, 4, 1, 3]