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.

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

Original entry on oeis.org

0, 0, 9, 198, 2294, 19467, 126864, 674922, 2997717, 11615754, 39660995, 123162204, 348412638, 920581314, 2264397902, 5294830516, 11692554408, 24858751383, 50403391227, 99282023930, 187902783369, 347689331443, 621482071507
Offset: 1

Views

Author

R. H. Hardin Sep 20 2010

Keywords

Comments

Column 7 of A180782

Examples

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