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 A099834 #3 Mar 31 2012 10:29:05
%S A099834 5,15,53,109,209,351,573,811,1193,1509,1971,2501,3183,3769,4511,5025,
%T A099834 5641,6165,6600,6964,7354,7696,7960,8110,8404,8606,8704,8846,8962,
%U A099834 9125,9210,9284,9362,9420
%N A099834 Maximum number of different determinants that can be produced by permuting the elements of a 3 X 3 integer matrix with nonnegative entries <= n.
%C A099834 For large values of n it is always possible to find a matrix that produces A088021(3)=10080 different determinants. Examples are given in the link. Currently (October 2004) the smallest known n for which a(n)=10080 is 100. The elements of the corresponding matrix are given in A098072.
%H A099834 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 A099834 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a099834.txt">Elements of 3 X 3 matrices with maximal number of different determinants.</a>
%e A099834 a(10)=1509: A corresponding set of matrix elements is {10,9,9,8,7,5,2,1,0}.
%Y A099834 Cf. A033431, A088021, A088217, A089472, A099815.
%Y A099834 Cf. A099815 largest determinant that can be produced by the optimal set of matrix elements.
%K A099834 nonn,hard
%O A099834 1,1
%A A099834 _Hugo Pfoertner_, Oct 29 2004