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!)
A180794 Number of distinct solutions of sum{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1 1
1, 4, 8, 20, 28, 56, 64, 122, 150, 218, 216, 424, 346, 544, 667, 863, 733, 1305, 1000, 1752, 1715, 1944, 1728, 3258, 2535, 3142, 3495, 4520, 3382, 6254, 4096, 6486, 6243, 6812, 7315, 10959, 6868, 9400, 10121, 13922, 9271, 16388, 10648, 16520, 17805 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Column 2 of A180803
LINKS
EXAMPLE
Solutions for sum of products of 2 0..4 pairs = 0 (mod 5) are
(0*0 + 0*0) (0*0 + 0*1) (0*0 + 0*2) (0*0 + 0*3) (0*0 + 0*4) (0*1 + 0*1)
(0*1 + 0*2) (0*1 + 0*3) (0*1 + 0*4) (0*2 + 0*2) (0*2 + 0*3) (0*2 + 0*4)
(0*3 + 0*3) (0*3 + 0*4) (0*4 + 0*4) (1*1 + 1*4) (1*1 + 2*2) (1*1 + 3*3)
(1*2 + 1*3) (1*2 + 2*4) (1*3 + 3*4) (1*4 + 2*3) (1*4 + 4*4) (2*2 + 2*3)
(2*2 + 4*4) (2*3 + 3*3) (2*4 + 3*4) (3*3 + 4*4)
CROSSREFS
Sequence in context: A191483 A062717 A084922 * A047185 A349546 A034733
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 29 02:23 EDT 2024. Contains 371264 sequences. (Running on oeis4.)