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.

A143069 Least number k such that n*k has the fewest possible ones in its binary expansion.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 5, 1, 1, 1, 1, 1, 27, 1, 1, 3, 3, 1, 41, 5, 19, 1, 565, 1, 1, 1, 1, 1, 1, 1, 7085, 27, 7, 1, 25, 1, 3, 3, 1, 3, 11, 1, 1, 41, 1, 5, 1266205, 19, 7, 1, 9, 565, 9099507, 1, 17602325, 1, 1, 1, 1, 1, 128207979, 1, 1, 1, 119, 1, 1, 7085, 1, 27, 5, 7, 13]