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.

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

Table of values

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

List of values

[1, 0, 1, 1, 3, 0, 1, 2, 1, 1, 1, 3, 7, 0, 1, 2, 1, 2, 5, 2, 3, 1, 1, 2, 3, 3, 3, 7, 15, 0, 1, 2, 1, 4, 2, 2, 3, 2, 2, 10, 5, 2, 5, 3, 7, 1, 1, 2, 3, 2, 5, 6, 3, 3, 3, 3, 3, 7, 7, 15, 31, 0, 1, 2, 1, 4, 2, 2, 3, 4, 9, 2, 2, 4, 2, 3, 7, 2, 2, 2, 2, 10, 21, 5, 5, 2, 2, 5, 11, 3, 5, 7, 15, 1, 1, 2, 3, 4, 2, 6, 3, 2]