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!)
A180777 Number of distinct solutions of sum{i=1..6}(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,12,118,995,6518,32893,139369,499659,1599064,4551225,12014040,

%T 29034510,66658219,142828285,295240250,576393604,1098913338,

%U 1993354080,3560486370,6091808112,10312711744,16796812703,27247744649,42564714900

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

%C Column 6 of A180782

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

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

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

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

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

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

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

%e (1*2 + 1*2 + 1*2 + 2*2 + 2*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 April 19 21:09 EDT 2024. Contains 371798 sequences. (Running on oeis4.)