id:A057980 - OEIS Search Results

Search: id:A057980

Displaying 1-1 of 1 results found.

page 1

Let n be a positive integer, n>3. Define a tournament on the vertex set {2,3,..,n} by: for i < j, i is adjacent to j if i divides j, else j is adjacent to i. If T(n) denotes its adjacency matrix, then the above sequence is det(T(n))for n=4,5,6....42.

+0
2

1, 0, 2, 0, 2, -6, 14, 0, 44, 0, 18, -214, 308, 0, 168, 0, 516, -2008, 2328, 0, 14232, -11124, 15552, -29556, 95592, 0, 244464, 0, 250344, -1012558, 1292240, -5809920, 11906420, 0, -5994822, -7669356, 64935420, 0, 40213980 (list; graph; listen)

	OFFSET	`4,3`
	COMMENT	`MATLAB program was used to generate the tournament matrices T(n) and evaluate determinants. Obviously det(T(n))=0 if n is prime.`
	CROSSREFS	`Sequence in context: A033757 A136426 A094385 this_sequence A081081 A111111 A088996` `Adjacent sequences: A057977 A057978 A057979 this_sequence A057981 A057982 A057983`
	KEYWORD	`sign`
	AUTHOR	`Rohan Hemasinha (rhemasin(AT)uwf.edu), Nov 27 2000`

page 1

Search completed in 0.002 seconds

Last modified September 5 01:44 EDT 2008. Contains 143476 sequences.

AT&T Labs Research