The OEIS is supported by the many generous donors to the OEIS Foundation.



Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301372 Conjectured best solution for the problem stated in A098072. 4
0, 1, 20, 54, 61, 87, 89, 97, 99 (list; graph; refs; listen; history; text; internal format)



In A098072 an example of a 3 X 3 matrix was shown that produces the maximum number A088021(3)=10080 of distinct determinants when all permutations of the given matrix entries are performed under the condition of minimizing the greatest entry of the matrix. The current sequence improves this result, i.e., the maximum is reduced from 100 to 99. It is optimal under the assumptions that the matrix entries are distinct and that the two smallest entries are 0 and 1.

The resulting determinant values are given in A301757.


Table of n, a(n) for n=1..9.


Cf. A088021, A098072, A301757.

Sequence in context: A329628 A302885 A059677 * A108108 A316935 A123456

Adjacent sequences: A301369 A301370 A301371 * A301373 A301374 A301375




Hugo Pfoertner, Mar 26 2018



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 7 17:25 EST 2022. Contains 358668 sequences. (Running on oeis4.)