|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
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
|
|
|
PROG
|
(Python)
print([n*n & n for n in range(99)])
(Haskell)
import Data.Bits ((.&.))
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|