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.

A306352 a(n) is the least k >= 0 such that all the positive divisors of n have a distinct value under the mapping d -> d AND k (where AND denotes the bitwise AND operator).

Table of values

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

List of values

[0, 1, 2, 3, 4, 7, 2, 7, 10, 13, 2, 15, 4, 5, 6, 15, 16, 31, 2, 29, 6, 7, 2, 31, 12, 9, 10, 11, 4, 15, 2, 31, 42, 49, 6, 63, 4, 7, 6, 63, 8, 15, 2, 14, 14, 5, 2, 63, 18, 29, 18, 21, 4, 31, 6, 23, 18, 9, 2, 31, 4, 5, 14, 63, 76, 127, 2, 115, 6, 15, 2, 127, 8, 13]