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.

A326774 For any number m, let m* be the bi-infinite string obtained by repetition of the binary representation of m; this sequence lists the numbers n such that for any k < n, n* does not equal k* up to a shift.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 5
5 8
6 9
7 11
8 16
9 17
10 18
11 19
12 21
13 23
14 32
15 33
16 34
17 35
18 37
19 38
20 39
21 43
22 47
23 64
24 65
25 66
26 67
27 68
28 69
29 70
30 71
31 73
32 74
33 75
34 77
35 78
36 79
37 85
38 87
39 91
40 95
41 128
42 129
43 130
44 131
45 132
46 133
47 134
48 135
49 137
50 138
51 139
52 140
53 141
54 142
55 143
56 146
57 147
58 149
59 150
60 151
61 154

List of values

[0, 1, 2, 4, 5, 8, 9, 11, 16, 17, 18, 19, 21, 23, 32, 33, 34, 35, 37, 38, 39, 43, 47, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 77, 78, 79, 85, 87, 91, 95, 128, 129, 130, 131, 132, 133, 134, 135, 137, 138, 139, 140, 141, 142, 143, 146, 147, 149, 150, 151, 154]