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!)
A180832 Number of distinct solutions of sum{i=1..9}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2 1
0, 0, 0, 0, 15, 263, 6946, 95702, 1113010, 9143911, 64448228, 363369141, 1820591529, 7808981077, 30658462967, 107320405217, 351179673988, 1052229547028, 2992063116924, 7932504265966, 20180975666040, 48485253590942 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Column 9 of A180834
LINKS
EXAMPLE
Solutions for sum of products of 9 2..3 pairs = 1 (mod 5) are
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3)
(2*2 + 2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3)
(2*2 + 2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3)
(2*2 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
(2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3)
(3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
CROSSREFS
Sequence in context: A099273 A206230 A209263 * A361185 A013381 A013384
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 23 03:30 EDT 2024. Contains 371906 sequences. (Running on oeis4.)