cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A321338 Number of solutions to dft(a)^2 + dft(b)^2 + dft(c)^2 + dft(d)^2 = 4n, where a,b,c,d are even +1,-1 sequences of length n and dft(x) denotes the discrete Fourier transform of x.

Table of values

n a(n)
1 16
2 96
3 64
4 256
5 192
6 1536
7 960

List of values

[16, 96, 64, 256, 192, 1536, 960]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.