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.

A101933 Concatenate the first n positive integers written in binary (with each integer written so the most significant 1 is on the left and the concatenated string is from left to right, A030302). a(n) is the number of times n written in binary appears disjointedly in the concatenated string.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 3, 1, 2, 1, 4, 3, 4, 5, 4, 1, 2, 2, 3, 2, 2, 1, 6, 3, 4, 4, 6, 6, 5, 7, 5, 1, 2, 2, 3, 1, 4, 3, 4, 2, 4, 2, 5, 2, 3, 4, 8, 3, 4, 5, 5, 4, 6, 4, 8, 6, 6, 6, 7, 9, 6, 9, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 2, 3, 5, 2, 6, 4, 5, 2, 4, 3, 6, 3, 3, 3, 7, 2, 5, 3, 5, 3, 7, 5, 10, 3, 4, 5, 5, 4, 7, 5, 7, 4, 6]