A321851 Number of solutions to |dft(a)^2 + dft(b)^2 + dft(d)^2| + |dft(c)^2| = 4n, where a,b,c,d are +1,-1 sequences of length n and dft(x) denotes the discrete Fourier transform of x.
16, 96, 480, 1600, 4800, 13824
Offset: 1
Links
- L. D. Baumert and M. Hall, Hadamard matrices of the Williamson type, Math. Comp. 19:91 (1965) 442-447.
- Jeffery Kline, Geometric Search for Hadamard Matrices, Theoret. Comput. Sci. 778 (2019), 33-46.
- Jeffery Kline, List of tuples (a,b,c,d) to demonstrate that a(n)>0, for 1<=n<=33 and n=35.
Comments