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.

A073642 Replace 2^k in the binary representation of n with k (i.e., if n = 2^b + 2^c + 2^d + ... then a(n) = b + c + d + ...).

Table of values

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

List of values

[0, 0, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 5, 5, 6, 6, 4, 4, 5, 5, 6, 6, 7, 7, 7, 7, 8, 8, 9, 9, 10, 10, 5, 5, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 10, 10, 11, 11, 9, 9, 10, 10, 11, 11, 12, 12, 12, 12, 13, 13, 14, 14, 15, 15, 6, 6, 7, 7, 8, 8, 9, 9, 9, 9, 10, 10, 11, 11, 12, 12, 10, 10, 11, 11, 12, 12, 13, 13]