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.

A141298 a(n) = number of distinct substrings in the binary representation of n that each occur multiple times.

Table of values

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

List of values

[0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 1, 2, 1, 2, 3, 3, 3, 3, 2, 3, 5, 3, 2, 3, 2, 3, 2, 3, 2, 3, 4, 4, 4, 4, 3, 5, 4, 3, 3, 4, 4, 7, 5, 3, 5, 4, 3, 4, 3, 3, 3, 3, 5, 5, 2, 4, 3, 4, 2, 4, 3, 4, 5, 5, 5, 5, 4, 5, 5, 4, 4, 5, 8, 5, 4, 5, 4, 4, 4, 5, 5, 5, 4, 7, 9, 5, 6, 4, 4, 5, 8, 4, 6, 5, 4, 5, 4, 4, 4, 5, 4, 5, 3, 4, 4]