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.

A261891 Least k>0 such that n AND (k*n) = 0, where AND stands for the binary AND operator.

Table of values

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

List of values

[2, 2, 4, 2, 2, 4, 8, 2, 2, 2, 12, 4, 10, 8, 16, 2, 2, 2, 4, 2, 2, 12, 24, 4, 4, 10, 12, 8, 10, 16, 32, 2, 2, 2, 4, 2, 2, 4, 40, 2, 2, 2, 12, 12, 10, 24, 48, 4, 4, 4, 4, 10, 34, 12, 56, 8, 18, 10, 12, 16, 42, 32, 64, 2, 2, 2, 4, 2, 2, 4, 8, 2, 2, 2, 12, 4, 10]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.