cp's OEIS Frontend

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.

Showing 1-1 of 1 results.

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.

Original entry on oeis.org

5, 15, 53, 109, 209, 351, 573, 811, 1193, 1509, 1971, 2501, 3183, 3769, 4511, 5025, 5641, 6165, 6600, 6964, 7354, 7696, 7960, 8110, 8404, 8606, 8704, 8846, 8962, 9125, 9210, 9284, 9362, 9420
Offset: 1

Views

Author

Hugo Pfoertner, Oct 29 2004

Keywords

Comments

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.

Examples

			a(10)=1509: A corresponding set of matrix elements is {10,9,9,8,7,5,2,1,0}.

Links

Crossrefs

Cf. A033431, A088021, A088217, A089472, A099815.
Cf. A099815 largest determinant that can be produced by the optimal set of matrix elements.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.