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.

A295827 a(n) = least odd k > 1 such that n and n*k have the same Hamming weight, or -1 if no such k exists.

Table of values

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

List of values

[-1, -1, 3, -1, 13, 3, 3, -1, 57, 13, 35, 3, 21, 3, 3, -1, 241, 57, 7, 13, 13, 35, 39, 3, 169, 21, 5, 3, 21, 3, 3, -1, 993, 241, 11, 57, 7, 7, 5, 13, 3197, 13, 9, 35, 3, 39, 13, 3, 21, 169, 3, 21, 39, 5, 47, 3, 27, 21, 5, 3, 13, 3, 3, -1, 4033, 993, 491, 241]