login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A180805 Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() in 0..n-1 1
0, 4, 18, 50, 136, 262, 583, 974, 1794, 2603, 4560, 6190, 9987, 12617, 19419, 24264, 35818, 41262, 61133, 70126, 97274, 110076, 154038, 167176, 230205, 247554, 328518, 357811, 476360, 485118, 660061, 688320, 874343, 917049, 1189870, 1192404 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Column 3 of A180813

LINKS

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

EXAMPLE

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

(0*0 + 0*0 + 1*1) (0*0 + 0*0 + 2*2) (0*0 + 0*1 + 1*1) (0*0 + 0*1 + 2*2)

(0*0 + 0*2 + 1*1) (0*0 + 0*2 + 2*2) (0*0 + 1*2 + 1*2) (0*1 + 0*1 + 1*1)

(0*1 + 0*1 + 2*2) (0*1 + 0*2 + 1*1) (0*1 + 0*2 + 2*2) (0*1 + 1*2 + 1*2)

(0*2 + 0*2 + 1*1) (0*2 + 0*2 + 2*2) (0*2 + 1*2 + 1*2) (1*1 + 1*1 + 1*2)

(1*1 + 1*2 + 2*2) (1*2 + 2*2 + 2*2)

CROSSREFS

Sequence in context: A081528 A056147 A181857 * A120656 A256431 A256430

Adjacent sequences:  A180802 A180803 A180804 * A180806 A180807 A180808

KEYWORD

nonn

AUTHOR

R. H. Hardin, suggested by Max Alekseyev in the Sequence Fans Mailing List, 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 3 10:49 EST 2016. Contains 278699 sequences.