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.

A086063 a(n) = if n<=1 then 1 else smallest k>1 such that in binary representation n is contained in n^k.

Table of values

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

List of values

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