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.

A342241 a(n) is the least k > 0 such that the first k bits and the last k bits in the binary expansion of n are the same.

Table of values

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

List of values

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