Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049475
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049475 Number of 2n X 2n matrices whose entries are {0,-1,+1} and whose row sums and column sums are all distinct. +0
5
1, 4, 39, 2260, 1338614 (list; graph; listen)
OFFSET

1,2

COMMENT

Matrices differing by taking transpose, multiplying by -1 and permuting rows and columns are regarded as equivalent.

REFERENCES

It is known (see references) that a (2n+1) X (2n+1) matrix of this form cannot exist.

Rainer Bodendiek, Gustav Burosch; Streifz"uge durch die Kombinatorik, Aufgaben und L"osungen aus dem Schatz der Mathematik-Olympiaden, (Excursions into Combinatorics) Spektrum Akademischer Verlag, Heidelberg, 1995, ISBN 3-86025-393-X Kapitel: Aufgaben zu Invarianten, Aufgabe 5.30, pp. 250-253.

Fred Galvin, posting to sci.math, Date: 1999-09-25 - Solution to the antimagic 0,1,-1 matrix problem.

LINKS

Eric Weisstein's World of Mathematics, See also

EXAMPLE

A 2 X 2 example: [ 1 1; 0 -1 ].

CROSSREFS

Cf. A049526, A049527.

Sequence in context: A165434 A086217 A094156 this_sequence A080271 A104292 A131535

Adjacent sequences: A049472 A049473 A049474 this_sequence A049476 A049477 A049478

KEYWORD

nonn,nice,hard

AUTHOR

Michael Kleber (michael.kleber(AT)gmail.com)

EXTENSIONS

Bodendiek-Burosch reference from TORSTEN.SILLKE(AT)LHSYSTEMS.COM.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research