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.

A180800 Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.

Original entry on oeis.org

1, 25, 435, 6302, 63988, 526152, 3362296, 18294610, 83656074, 340334735, 1222011919, 4033921144, 12105114076, 34125015671, 89380952993, 223056939011, 524533055884, 1188931232028, 2564070855994, 5372508105333, 10797948228909
Offset: 1

Views

Author

R. H. Hardin, suggested by Max Alekseyev in the Sequence Fans Mailing List, Sep 20 2010

Keywords

Comments

Column 8 of A180803

Examples

			Solutions for sum of products of 8 0..1 pairs = 0 (mod 2) are
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0)
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*0 + 1*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
(0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
(0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*1 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*0 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
(0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1)
(0*0 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
(0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1)
(0*1 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*1 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)
(1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)