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.

A343852 a(n) is the least k > 0 such that the binary expansions of k and of n + k have the same numbers of 0's and of 1's.

Table of values

n a(n)
1 5
2 10
3 9
4 20
5 21
6 18
7 17
8 40
9 19
10 42
11 38
12 36
13 37
14 34
15 33
16 80
17 35
18 38
19 37
20 84
21 35
22 76
23 74
24 72
25 73
26 74
27 70
28 68
29 69
30 66
31 65
32 160
33 67
34 70
35 69
36 76
37 67
38 74
39 73
40 168
41 75
42 70
43 69
44 152
45 67
46 148
47 146
48 144
49 71
50 146
51 145
52 148
53 140
54 140
55 138
56 136
57 137
58 138
59 134
60 132
61 133

List of values

[5, 10, 9, 20, 21, 18, 17, 40, 19, 42, 38, 36, 37, 34, 33, 80, 35, 38, 37, 84, 35, 76, 74, 72, 73, 74, 70, 68, 69, 66, 65, 160, 67, 70, 69, 76, 67, 74, 73, 168, 75, 70, 69, 152, 67, 148, 146, 144, 71, 146, 145, 148, 140, 140, 138, 136, 137, 138, 134, 132, 133]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.