A165554 a(n) = 2 * ceiling(n*((n^2)!^(1/n))).

2, 20, 428, 17110, 1091766, 101766250, 13040248694, 2198098221276, 471419186556726, 125322878397310538, 40439205050500365772, 15568170274714608264574, 7048162234159021690430456

Offset

1,1

Comments

This sequence is suggested by taking m = n (the square table case) in the formula for the lower bound for the minimization problem discussed at the Alpern link.

Original formula was corrected because the minimization is done for both product of rows and product of columns, so their sum is always even.

Links

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

Dario Alpern, Table of numbers problem

Prog

(PARI) a(n) = 2*ceil(n*((n^2)!)^(1/n))

Crossrefs

Sequence in context: A090309 A002116 A058346 * A366447 A009746 A009749

Adjacent sequences: A165551 A165552 A165553 * A165555 A165556 A165557

Keyword

nonn

Author

Rick L. Shepherd, Sep 21 2009

Status

approved