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!)
A180833 Number of distinct solutions of sum{i=1..10}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2 1
0, 0, 0, 0, 11, 403, 13194, 232088, 3338772, 34074527, 290017026, 1971610995, 11651785754, 58783446024, 266722410390, 1076378114380, 4003448283079, 13607830717566, 43384915194505, 128790677366846, 363254278026186 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Column 10 of A180834

LINKS

R. H. Hardin, Table of n, a(n) for n=1..183

EXAMPLE

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

(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3)

(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 3*3)

(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3)

(2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3)

(2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3)

(2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3)

(2*2 + 2*2 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)

(2*2 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3)

(2*2 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)

(2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 2*3 + 3*3 + 3*3)

(2*3 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)

CROSSREFS

Sequence in context: A055409 A067406 A046281 * A180821 A285926 A197599

Adjacent sequences:  A180830 A180831 A180832 * A180834 A180835 A180836

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 June 27 13:50 EDT 2022. Contains 354896 sequences. (Running on oeis4.)