login

Revision History for A180789

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Number of distinct solutions of sum{i=1..7}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 1..n-1
(history; published version)
#3 by Russ Cox at Sat Mar 31 12:35:46 EDT 2012
AUTHOR

_R. H. Hardin (rhhardin(AT)att.net) _ Sep 20 2010

Discussion
Sat Mar 31
12:35
OEIS Server: https://oeis.org/edit/global/875
#2 by N. J. A. Sloane at Thu Nov 11 07:34:06 EST 2010
LINKS

R. H. Hardin, <a href="/A180789/b180789.txt">Table of n, a(n) for n=1..183</a>

KEYWORD

nonn,new

nonn

#1 by N. J. A. Sloane at Sat Oct 02 03:00:00 EDT 2010
NAME

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

DATA

0, 1, 15, 198, 2282, 19300, 126861, 670058, 2997685, 11539243, 39660969, 122371876, 348412793, 914595808, 2264326584, 5259342780, 11692554312, 24683815072, 50403390786, 98560661538, 187881799209, 345060981679, 621482071341

OFFSET

1,3

COMMENTS

Column 7 of A180793

LINKS

R. H. Hardin, <a href="b180789.txt">Table of n, a(n) for n=1..183</a>

EXAMPLE

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

KEYWORD

nonn,new

AUTHOR

R. H. Hardin (rhhardin(AT)att.net) Sep 20 2010

STATUS

approved