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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098072 An example of a 3 X 3 matrix with nonnegative elements that produces the maximum possible number of 10080 different determinants if all 9! permutations of the matrix elements are performed. The target is to find a matrix for which the largest element becomes as small as possible. 1
0, 1, 17, 43, 82, 87, 88, 91, 100 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

In November 2004 this is the example with the smallest known largest element. It was found in a random search after 3 CPU (1.5 GHz Intel Itanium 2) months. No improvement was found in another 6 months of CPU time.

LINKS

Hugo Pfoertner, List of 3 X 3 integer matrices that give 10080 different determinants.

Hugo Pfoertner, Search minimal 3 X 3 matrix with 10080 different determinants. FORTRAN program.

PROG

FORTRAN program given at link.

CROSSREFS

Cf. A088021 maximal number of different determinants of an n X n matrix, A099834 different determinants of matrix with nonnegative entries <=n.

Sequence in context: A109998 A031340 A172044 * A130467 A112885 A093191

Adjacent sequences:  A098069 A098070 A098071 * A098073 A098074 A098075

KEYWORD

fini,full,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Nov 19 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:00 EST 2012. Contains 206050 sequences.