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 A098072 #12 May 29 2025 10:41:51 %S A098072 0,1,17,43,82,87,88,91,100 %N 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. %C A098072 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. %H A098072 Hugo Pfoertner, <a href="http://www.randomwalk.de/scimath/d33list.txt">List of 3 X 3 integer matrices that give 10080 different determinants.</a> %H A098072 Hugo Pfoertner, <a href="http://www.randomwalk.de/scimath/mxnd3.txt">Search minimal 3 X 3 matrix with 10080 different determinants.</a> FORTRAN program. %o A098072 (Fortran) ! See Links section. %Y A098072 Cf. A088021 maximal number of different determinants of an n X n matrix, A099834 different determinants of matrix with nonnegative entries <=n. %Y A098072 Improved solution: A301372. %Y A098072 Optimal solution found by exhaustive search: A316601. %K A098072 fini,full,nonn %O A098072 1,3 %A A098072 _Hugo Pfoertner_, Nov 19 2004