|
|
A350289
|
|
Infinite binary Walsh matrix read by antidiagonals.
|
|
0
|
|
|
0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
The binary Walsh matrix of order 2^n, using natural ordering, is the 2^n-th principal submatrix of this matrix.
This sequence begins to diverge from A219463 at n=24, corresponding to (i,j)=(3,3).
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
Top left corner of infinite binary Walsh matrix:
0 0 0 0 0 0 0 0
0 1 0 1 0 1 0 1
0 0 1 1 0 0 1 1
0 1 1 0 0 1 1 0
0 0 0 0 1 1 1 1
0 1 0 1 1 0 1 0
0 0 1 1 1 1 0 0
0 1 1 0 1 0 0 1
|
|
MATHEMATICA
|
Flatten[Table[
Mod[DigitCount[BitAnd[k, n - k], 2, 1], 2], {n, 0, 14}, {k, 0, n}]]
|
|
PROG
|
(PARI) A(i, j) = hammingweight(bitand(i, j)) % 2
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|