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.

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

Original entry on oeis.org

1, 16, 159, 1336, 7770, 39768, 158242, 576277, 1770957, 5103172, 13020114, 32106338, 71312200, 155419661, 313496424, 622375358, 1154635735, 2140048203, 3718742275, 6493401148, 10741764465, 17813177343, 28173574540, 45107483725
Offset: 1

Views

Author

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

Keywords

Comments

Column 6 of A180803

Examples

			Solutions for sum of products of 6 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*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 0*0 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*1 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 1*1 + 1*1 + 1*1 + 1*1) (0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
(0*0 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1) (0*0 + 0*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 + 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)