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!)
A180814 Number of distinct solutions of Sum_{i=1..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2. 1
0, 0, 0, 1, 2, 6, 8, 27, 30, 59, 64, 147, 128, 212, 265, 380, 347, 623, 512, 897, 882, 1074, 1000, 1863, 1437, 1907, 2100, 2767, 2204, 3916, 2744, 4255, 4080, 4655, 4783, 7374, 4922, 6686, 7059, 9691, 6869, 11610, 8000, 12011, 12697, 12396, 10648, 18978, 13031 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Column 2 of A180823.
LINKS
EXAMPLE
Solutions for sum of products of 2 2..6 pairs = 0 (mod 8) are
(2*2 + 2*2) (2*2 + 2*6) (2*2 + 3*4) (2*2 + 4*5) (2*2 + 6*6) (2*3 + 2*5)
(2*3 + 3*6) (2*4 + 2*4) (2*4 + 4*4) (2*4 + 4*6) (2*5 + 5*6) (2*6 + 2*6)
(2*6 + 3*4) (2*6 + 4*5) (2*6 + 6*6) (3*3 + 3*5) (3*4 + 3*4) (3*4 + 4*5)
(3*4 + 6*6) (3*5 + 5*5) (3*6 + 5*6) (4*4 + 4*4) (4*4 + 4*6) (4*5 + 4*5)
(4*5 + 6*6) (4*6 + 4*6) (6*6 + 6*6)
CROSSREFS
Cf. A180823.
Sequence in context: A115506 A243552 A057852 * A290679 A290423 A368538
KEYWORD
nonn
AUTHOR
R. H. Hardin 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 April 19 16:08 EDT 2024. Contains 371794 sequences. (Running on oeis4.)