%I #32 Jun 25 2023 04:01:31
%S 0,1,0,1,0,1,4,1,0,1,0,9,0,9,4,1,0,1,0,1,16,17,4,17,0,17,0,25,16,9,4,
%T 1,0,1,0,1,0,1,36,33,0,1,32,41,0,41,4,33,0,33,0,33,16,49,36,17,0,49,
%U 32,25,16,9,4,1,0,1,0,1,0,1,4,1,64,65,64,73,0,9,68
%N a(n) = n AND n^2, where AND is the bitwise AND operator.
%C The graph of this sequence has the shape of a tilted Sierpinski triangle. - _WG Zeist_, Jan 15 2019
%H Reinhard Zumkeller, <a href="/A213541/b213541.txt">Table of n, a(n) for n = 0..8192</a>
%F a(2^k + x) = a(x) + (x^2 AND 2^k) for 0 <= x < 2^k. - _David Radcliffe_, May 06 2023
%t Table[BitAnd[n, n^2], {n, 0, 63}] (* _Alonso del Arte_, Jun 19 2012 *)
%o (Python)
%o print([n*n & n for n in range(99)])
%o (Haskell)
%o import Data.Bits ((.&.))
%o a213541 n = n .&. n ^ 2 -- _Reinhard Zumkeller_, Apr 25 2013
%o (PARI) a(n) = bitand(n, n^2); \\ _Michel Marcus_, Jan 15 2019
%Y Cf. A213370.
%Y Cf. A000290.
%Y Cf. A007745 (OR), A169810 (XOR), A002378.
%K nonn,base,easy,less,look
%O 0,7
%A _Alex Ratushnyak_, Jun 14 2012