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.

A161399 a(n) = the smallest divisor of n that contains the same number of (non-leading) 0's as n when both numbers are written in binary.

Table of values

n a(n)
1 1
2 2
3 1
4 4
5 5
6 2
7 1
8 8
9 9
10 10
11 11
12 4
13 13
14 2
15 1
16 16
17 17
18 18
19 19
20 20
21 21
22 22
23 23
24 8
25 25
26 26
27 27
28 4
29 29
30 2
31 1
32 32
33 33
34 34
35 35
36 36
37 37
38 38
39 39
40 40
41 41
42 42
43 43
44 44
45 9
46 46
47 47
48 16
49 49
50 50
51 51
52 52
53 53
54 9
55 5
56 8
57 19
58 58
59 59
60 4
61 61
62 2
63 1
64 64
65 65
66 66
67 67
68 68
69 69
70 70
71 71

List of values

[1, 2, 1, 4, 5, 2, 1, 8, 9, 10, 11, 4, 13, 2, 1, 16, 17, 18, 19, 20, 21, 22, 23, 8, 25, 26, 27, 4, 29, 2, 1, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 9, 46, 47, 16, 49, 50, 51, 52, 53, 9, 5, 8, 19, 58, 59, 4, 61, 2, 1, 64, 65, 66, 67, 68, 69, 70, 71]