

A213370


a(n) = n AND n*2, where AND is the bitwise AND operator.


8



0, 0, 0, 2, 0, 0, 4, 6, 0, 0, 0, 2, 8, 8, 12, 14, 0, 0, 0, 2, 0, 0, 4, 6, 16, 16, 16, 18, 24, 24, 28, 30, 0, 0, 0, 2, 0, 0, 4, 6, 0, 0, 0, 2, 8, 8, 12, 14, 32, 32, 32, 34, 32, 32, 36, 38, 48, 48, 48, 50, 56, 56, 60, 62, 0, 0, 0, 2, 0, 0, 4, 6, 0, 0, 0, 2, 8, 8
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,4


LINKS

T. D. Noe, Table of n, a(n) for n = 0..1023


FORMULA

a(n) = 2 * A048735(n).


MATHEMATICA

Table[BitAnd[n, 2n], {n, 0, 63}] (* Alonso del Arte, Jun 19 2012 *)


PROG

(Python)
for n in range(99):
print 2*n & n,


CROSSREFS

Cf. A080099, A213526, A048735.
Cf. A003714: indices of 0's.
Cf. A213540: indices of 2's, indices of 4's divided by 2.
Sequence in context: A131742 A257813 A278280 * A244138 A284611 A282551
Adjacent sequences: A213367 A213368 A213369 * A213371 A213372 A213373


KEYWORD

nonn,base,easy


AUTHOR

Alex Ratushnyak, Jun 14 2012


STATUS

approved



