This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A301372 #6 Mar 26 2018 20:35:04 %S A301372 0,1,20,54,61,87,89,97,99 %N A301372 Conjectured best solution for the problem stated in A098072. %C A301372 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 A301372 The resulting determinant values are given in A301757. %Y A301372 Cf. A088021, A098072, A301757. %K A301372 nonn,fini,full %O A301372 1,3 %A A301372 _Hugo Pfoertner_, Mar 26 2018