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.

A277008 Numbers k such that in the binary expansion of k no run of 1-bits is longer than 1 + the total number of 0-bits anywhere to the right of that run.

Table of values

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

List of values

[0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 16, 17, 18, 20, 21, 22, 24, 25, 26, 28, 32, 33, 34, 36, 37, 38, 40, 41, 42, 44, 45, 48, 49, 50, 52, 53, 54, 56, 57, 58, 64, 65, 66, 68, 69, 70, 72, 73, 74, 76, 77, 80, 81, 82, 84, 85, 86, 88, 89, 90, 92, 96, 97, 98, 100, 101, 102, 104, 105, 106, 108, 109, 112, 113, 114, 116, 117, 118, 120, 128]