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.

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

Original entry on oeis.org

0, 1, 12, 118, 995, 6518, 32893, 139369, 499659, 1599064, 4551225, 12014040, 29034510, 66658219, 142828285, 295240250, 576393604, 1098913338, 1993354080, 3560486370, 6091808112, 10312711744, 16796812703, 27247744649, 42564714900
Offset: 1

Views

Author

R. H. Hardin Sep 20 2010

Keywords

Comments

Column 6 of A180782

Examples

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