|
| |
|
|
A165554
|
|
Ceiling(2n((n^2)!^(1/n))).
|
|
0
| |
|
|
2, 20, 428, 17110, 1091765, 101766250, 13040248693, 2198098221276, 471419186556725, 125322878397310538, 40439205050500365771, 15568170274714608264573, 7048162234159021690430455
(list; graph; refs; listen; history; 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. (Note that some of these values, computed by PARI using 10000 digits of precision, are 1 less than those displayed there. Various usages of floor, ceil, and round have not matched all those values exactly.).
|
|
|
LINKS
| D. Alpern, Table of numbers problem
|
|
|
PROG
| (PARI) a(n) = ceil(2*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 (rshepherd2(AT)hotmail.com), Sep 21 2009
|
| |
|
|
