login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
1
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,3
COMMENTS
Column 6 of A180782
LINKS
EXAMPLE
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)
CROSSREFS
Sequence in context: A154346 A016142 A105218 * A163950 A025132 A001712
KEYWORD
nonn
AUTHOR
R. H. Hardin Sep 20 2010
STATUS
approved