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.

A143073 Least number k such that the binary expansion of n*k has fewer ones than n, or 0 if no such k exists.

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 5, 0, 0, 0, 0, 0, 27, 0, 0, 3, 3, 0, 41, 5, 3, 0, 5, 0, 0, 0, 0, 0, 0, 0, 7085, 27, 7, 0, 25, 0, 3, 3, 0, 3, 3, 0, 0, 41, 0, 5, 5, 3, 3, 0, 9, 5, 3, 0, 5, 0, 0, 0, 0, 0, 128207979, 0, 0, 0, 119, 0, 0, 7085, 0, 27, 5, 7, 7, 0, 1657009, 25, 395, 0, 0, 3, 3, 3, 0, 0]