login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Eric Weisstein's World of Mathematics, Walsh Function
Wikipedia, Walsh matrix
FORMULA
A(i,j) = A010060(A004198(i,j)) = hammingweight(i AND j) mod 2.
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
Cf. A197818 (negated antidiagonals as decimal), A228539, A228540.
Sequence in context: A354031 A354035 A025457 * A219463 A286688 A356923
KEYWORD
nonn,tabl
AUTHOR
Jeremy Tan, Dec 23 2021
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 26 12:21 EDT 2024. Contains 374632 sequences. (Running on oeis4.)