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.

A080941 Greatest proper divisor of n which is a suffix of n in binary representation; a(n) = 0 if no such divisor exists.

Table of values

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

List of values

[0, 0, 1, 0, 1, 2, 1, 0, 1, 2, 1, 4, 1, 2, 3, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 3, 4, 1, 6, 1, 0, 1, 2, 1, 4, 1, 2, 3, 8, 1, 2, 1, 4, 5, 2, 1, 16, 1, 2, 3, 4, 1, 6, 1, 8, 1, 2, 1, 12, 1, 2, 7, 0, 1, 2, 1, 4, 1, 2, 1, 8, 1, 2, 3, 4, 1, 6, 1, 16, 1, 2, 1, 4, 5, 2, 3, 8, 1, 10, 1, 4, 1, 2, 1, 32, 1, 2, 3, 4, 1, 6, 1]