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

 

Logo

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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180797 Number of distinct solutions of sum{i=1..5}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1 1
1, 12, 87, 549, 2338, 9383, 28783, 85956, 213618, 518268, 1100399, 2370275, 4457359, 8595967, 15130785, 26913348, 43848123, 74308434, 114423976, 184270107, 274414305, 419987334, 601573248, 905711494, 1247825148, 1806542438 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 5 of A180803

LINKS

R. H. Hardin, Table of n, a(n) for n=1..249

EXAMPLE

Solutions for sum of products of 5 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*1)

(0*0 + 0*0 + 0*0 + 0*1 + 0*1) (0*0 + 0*0 + 0*0 + 1*1 + 1*1)

(0*0 + 0*0 + 0*1 + 0*1 + 0*1) (0*0 + 0*0 + 0*1 + 1*1 + 1*1)

(0*0 + 0*1 + 0*1 + 0*1 + 0*1) (0*0 + 0*1 + 0*1 + 1*1 + 1*1)

(0*0 + 1*1 + 1*1 + 1*1 + 1*1) (0*1 + 0*1 + 0*1 + 0*1 + 0*1)

(0*1 + 0*1 + 0*1 + 1*1 + 1*1) (0*1 + 1*1 + 1*1 + 1*1 + 1*1)

CROSSREFS

Sequence in context: A243248 A046023 A183721 * A137207 A206765 A228500

Adjacent sequences: A180794 A180795 A180796 * A180798 A180799 A180800

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 December 2 11:37 EST 2022. Contains 358493 sequences. (Running on oeis4.)