The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301372 Conjectured best solution for the problem stated in A098072. 4


%S 0,1,20,54,61,87,89,97,99

%N Conjectured best solution for the problem stated in A098072.

%C 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.

%C The resulting determinant values are given in A301757.

%Y Cf. A088021, A098072, A301757.

%K nonn,fini,full

%O 1,3

%A _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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 12 21:10 EDT 2020. Contains 336440 sequences. (Running on oeis4.)