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”).

A180822
Number of distinct solutions of sum{i=1..10}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2
1
0, 0, 0, 1, 18, 602, 13198, 258821, 3339823, 35591489, 290017026, 2017329742, 11651785764, 59635283471, 266728654773, 1087436395076, 4003448283180, 13715992117054, 43384915194642, 129627173525396, 363261462194622
OFFSET
1,5
COMMENTS
Column 10 of A180823
LINKS
EXAMPLE
Solutions for sum of products of 10 2..3 pairs = 0 (mod 5) are
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3)
(2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
CROSSREFS
Sequence in context: A341305 A253826 A061079 * A295369 A350984 A281559
KEYWORD
nonn
AUTHOR
R. H. Hardin Sep 20 2010
STATUS
approved