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.

A319594 Number of solutions to dft(p)^2 + dft(q)^2 = (4n-3), where p and q are even sequences of length 2n-1, p(0)=0, p(k)=+1,-1 when k<>0, q(k) is +1,-1 for all k, and dft(x) denotes the discrete Fourier transform of x.

Table of values

n a(n)
1 2
2 4
3 4
4 12
5 12
6 0
7 12
8 16
9 0
10 36
11 24
12 0
13 20
14 36
15 0
16 60

List of values

[2, 4, 4, 12, 12, 0, 12, 16, 0, 36, 24, 0, 20, 36, 0, 60]

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

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