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.

A309342 a(1) = 0, and for n >= 1, a(n+1) is the number of times the binary representation of a(n) appears in the concatenation of the binary representations of a(1), ..., a(n-1).

Table of values

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

List of values

[0, 0, 1, 0, 2, 1, 2, 2, 3, 1, 7, 1, 11, 2, 5, 5, 7, 7, 9, 0, 12, 1, 30, 2, 12, 2, 14, 4, 3, 26, 4, 4, 5, 15, 13, 7, 24, 0, 34, 0, 39, 2, 27, 3, 45, 3, 49, 0, 49, 1, 89, 2, 36, 2, 39, 3, 60, 3, 66, 1, 112, 2, 45, 4, 19, 6, 26, 6, 28, 6, 30, 12, 12, 13, 20, 4]