login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A261891
Least k>0 such that n AND (k*n) = 0, where AND stands for the binary AND operator.
5
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
OFFSET
1,1
COMMENTS
All terms are even.
a(A003714(n)) = 2 for any n>0.
a(A004780(n)) > 2 for any n>0.
a(n) <= 2^A116361(n) for any n>0.
a(2n) = a(n) for any n>0.
EXAMPLE
For n=7:
+---+-------------+
| k | 7 AND (k*7) |
| | (in binary) |
+---+-------------+
| 1 | 111 |
| 2 | 110 |
| 3 | 101 |
| 4 | 100 |
| 5 | 11 |
| 6 | 10 |
| 7 | 1 |
| 8 | 0 |
+---+-------------+
Hence, a(7) = 8.
MATHEMATICA
Table[k = 1; While[BitAnd[k n, n] != 0, k++]; k, {n, 60}] (* Michael De Vlieger, Sep 06 2015 *)
PROG
(Perl) sub a {
my $n = shift;
my $k = 1;
while ($n & ($k*$n)) {
$k++;
}
return $k;
}
(PARI) a(n) = {k=1; while (bitand(n, k*n), k++); k; } \\ Michel Marcus, Sep 06 2015
(Python)
from itertools import count
def A261891(n): return next(k for k in count(2) if not n&k*n) # Chai Wah Wu, Jul 19 2024
CROSSREFS
KEYWORD
nonn,base,look
AUTHOR
Paul Tek, Sep 05 2015
STATUS
approved