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.

A343271 From left to right: the k-th binary digit of a(n) is the most frequent digit among the first k binary digits of n (in case of a tie, take the k-th binary digit of n).

Table of values

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

List of values

[0, 1, 2, 3, 4, 5, 7, 7, 8, 9, 10, 11, 14, 15, 15, 15, 16, 16, 18, 19, 20, 21, 23, 23, 28, 29, 31, 31, 31, 31, 31, 31, 32, 32, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 46, 47, 47, 47, 56, 57, 58, 59, 62, 63, 63, 63, 62, 63, 63, 63, 63, 63, 63, 63, 64, 64, 64, 64]