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.

A097295 Length of longest non-overlapping repeated subword of n in binary representation.

Table of values

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

List of values

[0, 0, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 2, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 3, 2, 2, 1, 2, 2, 2, 2, 2, 3, 2, 2, 1, 1, 2, 2, 2, 2, 3, 2, 1, 1, 2, 2, 2, 2, 2, 3, 1, 1, 2, 1, 3, 2, 2, 1, 3, 3, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 3, 3, 2, 3, 2, 2, 1, 1, 2, 2, 3, 2, 3, 2, 2, 2]