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!)
A180831 Number of distinct solutions of sum{i=1..8}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2 1
0, 0, 0, 0, 9, 166, 3474, 36866, 345458, 2263066, 13182593, 61265760, 260084494, 944238967, 3208593348, 9709481260, 27970062531, 73672570068, 187003944842, 441746651920, 1014700253185, 2196105354893, 4653016292528, 9374868346319 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,5
COMMENTS
Column 8 of A180834
LINKS
EXAMPLE
Solutions for sum of products of 8 2..3 pairs = 1 (mod 5) are
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*2 + 2*3 + 2*3 + 3*3 + 3*3 + 3*3)
(2*2 + 2*2 + 2*3 + 2*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*2 + 2*3 + 2*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 + 3*3)
(2*3 + 2*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3 + 3*3)
CROSSREFS
Sequence in context: A219074 A166180 A004107 * A361094 A367135 A367139
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 25 09:24 EDT 2024. Contains 371967 sequences. (Running on oeis4.)