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.

A083654 Consider the binary Champernowne sequence (A030190): number of successive numbers to be concatenated beginning with A083653(n) such that in binary representation n is contained.

Table of values

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

List of values

[1, 1, 1, 2, 1, 2, 2, 2, 1, 2, 1, 2, 2, 3, 2, 2, 1, 2, 2, 2, 2, 2, 2, 3, 2, 3, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 2, 3, 3, 2, 2, 3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 3, 3, 3, 2, 3, 3, 2, 2, 3, 2, 2, 2]