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!)
A180779 Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1 1

%I #3 Mar 31 2012 12:35:46

%S 0,1,15,327,4856,53455,444003,2948305,16112289,75389116,307372600,

%T 1122069080,3701885580,11258893954,31699979961,83910860201,

%U 209004408715,496246703439,1121475446118,2440154664350,5096346969372,10323359668079

%N Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 1..n-1

%C Column 8 of A180782

%H R. H. Hardin, <a href="/A180779/b180779.txt">Table of n, a(n) for n=1..183</a>

%e Solutions for sum of products of 8 1..2 pairs = 0 (mod 3) are

%e (1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*2)

%e (1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*2 + 2*2)

%e (1*1 + 1*1 + 1*1 + 1*1 + 1*2 + 1*2 + 1*2 + 1*2)

%e (1*1 + 1*1 + 1*1 + 1*1 + 1*1 + 1*2 + 2*2 + 2*2)

%e (1*1 + 1*1 + 1*1 + 1*1 + 1*2 + 2*2 + 2*2 + 2*2)

%e (1*1 + 1*1 + 1*1 + 1*2 + 1*2 + 1*2 + 1*2 + 2*2)

%e (1*1 + 1*1 + 1*1 + 1*2 + 2*2 + 2*2 + 2*2 + 2*2)

%e (1*1 + 1*1 + 1*2 + 1*2 + 1*2 + 1*2 + 2*2 + 2*2)

%e (1*1 + 1*1 + 1*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2)

%e (1*1 + 1*2 + 1*2 + 1*2 + 1*2 + 1*2 + 1*2 + 1*2)

%e (1*1 + 1*2 + 1*2 + 1*2 + 1*2 + 2*2 + 2*2 + 2*2)

%e (1*1 + 1*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2)

%e (1*2 + 1*2 + 1*2 + 1*2 + 1*2 + 1*2 + 1*2 + 2*2)

%e (1*2 + 1*2 + 1*2 + 1*2 + 2*2 + 2*2 + 2*2 + 2*2)

%e (1*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2)

%K nonn

%O 1,3

%A _R. H. Hardin_ Sep 20 2010

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 09:04 EDT 2024. Contains 371240 sequences. (Running on oeis4.)