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

A180809
Number of distinct solutions of sum{i=1..7}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1
1
0, 16, 264, 2768, 23256, 145098, 768537, 3329262, 12867751, 43149935, 133919155, 374105176, 988172550, 2405133108, 5629345146, 12325852092, 26226653125, 52794009238, 104124705338, 195815847774, 362865323820, 644935405583
OFFSET
1,2
COMMENTS
Column 7 of A180813
LINKS
EXAMPLE
Solutions for sum of products of 7 0..1 pairs = 1 (mod 2) are
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 1*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*0 + 1*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 1*1)
(0*0 + 0*0 + 0*1 + 0*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*0 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 1*1)
(0*0 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1 + 1*1)
(0*0 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 1*1)
(0*1 + 0*1 + 0*1 + 0*1 + 1*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 + 1*1 + 1*1)
CROSSREFS
Sequence in context: A302823 A303516 A240481 * A240633 A068770 A113359
KEYWORD
nonn
AUTHOR
R. H. Hardin, suggested by Max Alekseyev in the Sequence Fans Mailing List, Sep 20 2010
STATUS
approved