login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A165554 a(n) = 2 * ceiling(n*((n^2)!^(1/n))). 0
2, 20, 428, 17110, 1091766, 101766250, 13040248694, 2198098221276, 471419186556726, 125322878397310538, 40439205050500365772, 15568170274714608264574, 7048162234159021690430456 (list; graph; refs; listen; history; text; internal format)
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.

D. Alpern, Table of numbers problem

PROG

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

CROSSREFS

Sequence in context: A090309 A002116 A058346 * A009746 A009749 A012533

Adjacent sequences:  A165551 A165552 A165553 * A165555 A165556 A165557

KEYWORD

nonn

AUTHOR

Rick L. Shepherd, Sep 21 2009

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 October 26 14:28 EDT 2021. Contains 348267 sequences. (Running on oeis4.)