login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180798 Number of distinct solutions of sum{i=1..6}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1 1
1, 16, 159, 1336, 7770, 39768, 158242, 576277, 1770957, 5103172, 13020114, 32106338, 71312200, 155419661, 313496424, 622375358, 1154635735, 2140048203, 3718742275, 6493401148, 10741764465, 17813177343, 28173574540, 45107483725 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Column 6 of A180803
LINKS
EXAMPLE
Solutions for sum of products of 6 0..1 pairs = 0 (mod 2) are
(0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*0) (0*0 + 0*0 + 0*0 + 0*0 + 0*0 + 0*1)
(0*0 + 0*0 + 0*0 + 0*0 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 0*0 + 1*1 + 1*1)
(0*0 + 0*0 + 0*0 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 0*1 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*1 + 0*1 + 1*1 + 1*1)
(0*0 + 0*0 + 1*1 + 1*1 + 1*1 + 1*1) (0*0 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1)
(0*0 + 0*1 + 0*1 + 0*1 + 1*1 + 1*1) (0*0 + 0*1 + 1*1 + 1*1 + 1*1 + 1*1)
(0*1 + 0*1 + 0*1 + 0*1 + 0*1 + 0*1) (0*1 + 0*1 + 0*1 + 0*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)
CROSSREFS
Sequence in context: A101931 A220630 A041005 * A144453 A121036 A224058
KEYWORD
nonn
AUTHOR
R. H. Hardin, suggested by Max Alekseyev in the Sequence Fans Mailing List, Sep 20 2010
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 17:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)