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.

A331216 a(n) is the number of ways to write n = u + v where the binary representations of u and of v have the same number of 0's and the same number of 1's.

Table of values

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

List of values

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