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.

A147756 a(n) = the smallest integer m such that n = (the largest integer that, when represented in binary, occurs at least twice as a substring in the binary representation of m).

Table of values

n a(n)
0 4
1 3
2 10
3 7
4 36
5 21
6 54
7 15
8 136
9 73
10 42
11 91
12 204
13 109
14 238
15 31
16 528
17 273
18 146
19 307
20 660
21 85
22 182
23 375
24 792
25 409
26 858
27 219
28 924
29 477
30 990
31 63
32 2080
33 1057
34 546
35 1123
36 292
37 1189
38 614
39 1255
40 2600
41 1321
42 170
43 1387
44 2860
45 365
46 750
47 1519
48 3120
49 1585
50 3250
51 819
52 3380

List of values

[4, 3, 10, 7, 36, 21, 54, 15, 136, 73, 42, 91, 204, 109, 238, 31, 528, 273, 146, 307, 660, 85, 182, 375, 792, 409, 858, 219, 924, 477, 990, 63, 2080, 1057, 546, 1123, 292, 1189, 614, 1255, 2600, 1321, 170, 1387, 2860, 365, 750, 1519, 3120, 1585, 3250, 819, 3380]