[go: up one dir, main page]

login
Revision History for A180814 (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..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2.
(history; published version)
#5 by Wesley Ivan Hurt at Sun Jan 02 17:34:07 EST 2022
STATUS

editing

approved

#4 by Wesley Ivan Hurt at Sun Jan 02 17:33:51 EST 2022
NAME

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

COMMENTS

Column 2 of A180823.

CROSSREFS

Cf. A180823.

STATUS

approved

editing

#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="/A180814/b180814.txt">Table of n, a(n) for n=1..999</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..2}(x(2i-1)*x(2i)) = 0 (mod n), with x() only in 2..n-2

DATA

0, 0, 0, 1, 2, 6, 8, 27, 30, 59, 64, 147, 128, 212, 265, 380, 347, 623, 512, 897, 882, 1074, 1000, 1863, 1437, 1907, 2100, 2767, 2204, 3916, 2744, 4255, 4080, 4655, 4783, 7374, 4922, 6686, 7059, 9691, 6869, 11610, 8000, 12011, 12697, 12396, 10648, 18978, 13031

OFFSET

1,5

COMMENTS

Column 2 of A180823

LINKS

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

EXAMPLE

Solutions for sum of products of 2 2..6 pairs = 0 (mod 8) are

(2*2 + 2*2) (2*2 + 2*6) (2*2 + 3*4) (2*2 + 4*5) (2*2 + 6*6) (2*3 + 2*5)

(2*3 + 3*6) (2*4 + 2*4) (2*4 + 4*4) (2*4 + 4*6) (2*5 + 5*6) (2*6 + 2*6)

(2*6 + 3*4) (2*6 + 4*5) (2*6 + 6*6) (3*3 + 3*5) (3*4 + 3*4) (3*4 + 4*5)

(3*4 + 6*6) (3*5 + 5*5) (3*6 + 5*6) (4*4 + 4*4) (4*4 + 4*6) (4*5 + 4*5)

(4*5 + 6*6) (4*6 + 4*6) (6*6 + 6*6)

KEYWORD

nonn,new

AUTHOR

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

STATUS

approved