|
|
A055228
|
|
a(n) = ceiling(sqrt(n!)).
|
|
13
|
|
|
1, 1, 2, 3, 5, 11, 27, 71, 201, 603, 1905, 6318, 21887, 78912, 295260, 1143536, 4574144, 18859678, 80014835, 348776577, 1559776269, 7147792819, 33526120083, 160785623546, 787685471323, 3938427356615, 20082117944246, 104349745809074, 552166953567229
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
Axenovich's improvement to the Erdős strong Delta-system conjecture. Erdős and Rado called a family of sets {A1, A2, .., Ak} a strong Delta-system if all the intersections Ai INTERSECT Aj are identical, 1 <= i < j <= k. Denoting by f(n,k) the smallest integer m for which every family of n-sets {A1, A2, .., Am} contains k sets forming a strong Delta-system. Then Axenovich et al. proved f(n,3) < (n!)^((1/2) + epsilon)) < a(n) holds for every epsilon > 0, provided n is sufficiently large. - Jonathan Vos Post, Apr 29 2007; typos fixed by Li-yao Xia, May 06 2014
For n>0, a(n) is the least m>0 such that n! <= m^2. - Clark Kimberling, Jul 18 2012
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Python)
from math import isqrt, factorial
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
A comment stating that one of the terms was wrong has been deleted - the terms are correct. - T. D. Noe, Apr 22 2009
|
|
STATUS
|
approved
|
|
|
|