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.

A332011 Let k be the least positive number such that n AND floor(n/k) = 0 (where AND denotes the bitwise AND operator); a(n) = floor(n/k).

Table of values

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

List of values

[0, 0, 1, 0, 2, 2, 1, 0, 4, 4, 5, 0, 3, 2, 1, 0, 8, 8, 9, 4, 10, 10, 1, 0, 6, 6, 5, 4, 3, 2, 1, 0, 16, 16, 17, 8, 18, 18, 9, 0, 20, 20, 21, 4, 3, 2, 1, 0, 12, 12, 12, 12, 10, 10, 9, 0, 7, 6, 5, 4, 3, 2, 1, 0, 32, 32, 33, 16, 34, 34, 17, 8, 36, 36, 37, 4, 19, 2]