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

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

%S 0,0,0,1,7,57,286,1701,5969,22212,59824,173319,385060,920819,1831674,

%T 3839358,6872225,13243078,21945628,39182616,61892080,103355368,

%U 155139308,251041955,359562489,554717344,780642911,1160794113,1574984248

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

%C Column 5 of A180823

%H R. H. Hardin, <a href="/A180817/b180817.txt">Table of n, a(n) for n=1..251</a>

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

%e (2*2 + 2*2 + 2*2 + 2*2 + 2*2) (2*2 + 2*2 + 2*2 + 2*2 + 3*3)

%e (2*2 + 2*2 + 2*2 + 3*3 + 3*3) (2*2 + 2*2 + 3*3 + 3*3 + 3*3)

%e (2*2 + 3*3 + 3*3 + 3*3 + 3*3) (2*3 + 2*3 + 2*3 + 2*3 + 2*3)

%e (3*3 + 3*3 + 3*3 + 3*3 + 3*3)

%K nonn

%O 1,5

%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 July 26 09:25 EDT 2024. Contains 374628 sequences. (Running on oeis4.)