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.

A261892 Least multiple m of n such that n and m have no common one bit in their binary representations.

Table of values

n a(n)
1 2
2 4
3 12
4 8
5 10
6 24
7 56
8 16
9 18
10 20
11 132
12 48
13 130
14 112
15 240
16 32
17 34
18 36
19 76
20 40
21 42
22 264
23 552
24 96
25 100
26 260
27 324
28 224
29 290
30 480
31 992
32 64
33 66
34 68
35 140
36 72
37 74
38 152
39 1560
40 80
41 82
42 84
43 516
44 528
45 450
46 1104
47 2256
48 192
49 196
50 200
51 204
52 520
53 1802
54 648
55 3080
56 448

List of values

[2, 4, 12, 8, 10, 24, 56, 16, 18, 20, 132, 48, 130, 112, 240, 32, 34, 36, 76, 40, 42, 264, 552, 96, 100, 260, 324, 224, 290, 480, 992, 64, 66, 68, 140, 72, 74, 152, 1560, 80, 82, 84, 516, 528, 450, 1104, 2256, 192, 196, 200, 204, 520, 1802, 648, 3080, 448]