login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301372 Conjectured best solution for the problem stated in A098072. 4
0, 1, 20, 54, 61, 87, 89, 97, 99 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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.

The resulting determinant values are given in A301757.

LINKS

Table of n, a(n) for n=1..9.

CROSSREFS

Cf. A088021, A098072, A301757.

Sequence in context: A008524 A302885 A059677 * A108108 A316935 A123456

Adjacent sequences:  A301369 A301370 A301371 * A301373 A301374 A301375

KEYWORD

nonn,fini,full

AUTHOR

Hugo Pfoertner, Mar 26 2018

STATUS

approved

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 June 15 16:13 EDT 2019. Contains 324142 sequences. (Running on oeis4.)