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.

A228086 a(n) is the least k which satisfies n = k + bitcount(k), or 0 if no such k exists. Here bitcount(k) (or wt(k), A000120) gives the number of 1's in binary representation of nonnegative integer k.

Table of values

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

List of values

[0, 0, 1, 2, 0, 3, 0, 5, 6, 8, 7, 9, 10, 0, 11, 0, 13, 14, 0, 15, 18, 0, 19, 0, 21, 22, 24, 23, 25, 26, 0, 27, 0, 29, 30, 33, 31, 0, 35, 0, 37, 38, 40, 39, 41, 42, 0, 43, 0, 45, 46, 0, 47, 50, 0, 51, 0, 53, 54, 56, 55, 57, 58, 0, 59, 64, 61, 62, 66, 63, 67, 0]