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

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

%S 0,1,5,64,400,1914,7589,24902,73134,188315,455127,996083,2098908,

%T 4080930,7790731,13869018,24527424,40768032,67955336,106952861,

%U 169909977,255608028,390623704,566247614,837326375,1175991196,1690928973

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

%C Column 5 of A180793

%H R. H. Hardin, <a href="/A180787/b180787.txt">Table of n, a(n) for n=1..250</a>

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

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

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

%e (1*2 + 1*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 24 14:32 EDT 2024. Contains 371960 sequences. (Running on oeis4.)