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.

A178307 Remove powers of 2 from A000069. Let b(n) be n-th term of the remaining sequence. Then a(n) is the least number m such that (b(n))^m is in A001969.

Table of values

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

List of values

[3, 3, 2, 3, 3, 2, 3, 4, 2, 3, 3, 4, 2, 3, 3, 2, 3, 2, 4, 4, 2, 3, 3, 5, 2, 3, 4, 2, 4, 2, 2, 3, 4, 2, 3, 2, 3, 3, 3, 2, 2, 4, 4, 4, 9, 2, 2, 2, 3, 3, 2, 4, 5, 3, 2, 3, 3, 4, 2, 4, 2, 2, 4, 3, 3, 2, 2, 2, 3, 2, 4, 4, 2, 2, 3, 4, 2, 2, 4, 3, 3, 4, 5, 3, 5, 2, 2, 2, 6, 4, 4, 2, 4, 2, 2, 9, 2, 2, 2, 2, 3, 2, 3, 3, 3]