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.

A065413 Number of positive solutions to "numbers that are n times their number of binary 1's".

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 3, 1, 0, 0, 2, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 0, 1, 1, 2, 1, 1, 1, 1, 3, 0, 1, 0, 0, 1, 0, 2, 2, 0, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 2, 0, 2, 1, 1, 2, 1, 0, 2, 1, 2, 1, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 2, 3, 1, 0, 0, 1, 0, 0, 1, 0, 2, 1, 0, 0, 2]