[go: up one dir, main page]

login
A213541
a(n) = n AND n^2, where AND is the bitwise AND operator.
8
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, 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, 32, 25, 16, 9, 4, 1, 0, 1, 0, 1, 0, 1, 4, 1, 64, 65, 64, 73, 0, 9, 68
OFFSET
0,7
COMMENTS
The graph of this sequence has the shape of a tilted Sierpinski triangle. - WG Zeist, Jan 15 2019
LINKS
FORMULA
a(2^k + x) = a(x) + (x^2 AND 2^k) for 0 <= x < 2^k. - David Radcliffe, May 06 2023
MATHEMATICA
Table[BitAnd[n, n^2], {n, 0, 63}] (* Alonso del Arte, Jun 19 2012 *)
PROG
(Python)
print([n*n & n for n in range(99)])
(Haskell)
import Data.Bits ((.&.))
a213541 n = n .&. n ^ 2 -- Reinhard Zumkeller, Apr 25 2013
(PARI) a(n) = bitand(n, n^2); \\ Michel Marcus, Jan 15 2019
CROSSREFS
Cf. A213370.
Cf. A000290.
Cf. A007745 (OR), A169810 (XOR), A002378.
Sequence in context: A094924 A056968 A340221 * A181435 A206774 A307850
KEYWORD
nonn,base,easy,less,look
AUTHOR
Alex Ratushnyak, Jun 14 2012
STATUS
approved