login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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
Chai Wah Wu, Table of n, a(n) for n = 0..807 (n = 0..300 from T. D. Noe)
M. Axenovich, D. Fon-Der-Flaass and A. Kostochka, On set systems without weak 3-Delta-subsystems, Discrete Math. 138(1995), 57-62.
Bela Bollobas, To Prove and Conjecture: Paul Erdős and His Mathematics, Am. Math. Monthly, 105 (March 1998)3, p. 232.
P. Erdős and R. Rado, Intersection theorems for systems of finite sets I, J. London Math. Soc. (2) 35(1960), 85-90.
P. Erdős and R. Rado, Intersection theorems for systems of finite sets II, J. London Math. Soc. (2) 44(1969), 467-479.
FORMULA
a(n) = A003059(A000142(n)). - Jonathan Vos Post, Apr 29 2007
MAPLE
A055228:=n->ceil(sqrt(n!)); seq(A055228(n), n=0..30); # Wesley Ivan Hurt, May 06 2014
MATHEMATICA
Table[Ceiling[Sqrt[n!]], {n, 0, 30}] (* Wesley Ivan Hurt, May 06 2014 *)
PROG
(PARI) a(n) = ceil(sqrt(n!)) \\ Michel Marcus, Jul 30 2013
(Python)
from math import isqrt, factorial
def A055228(n): return 1+isqrt(factorial(n)-1) # Chai Wah Wu, Jul 28 2022
CROSSREFS
Sequence in context: A006888 A009589 A098179 * A173758 A098642 A079447
KEYWORD
easy,nonn
AUTHOR
Henry Bottomley, Jun 21 2000
EXTENSIONS
A comment stating that one of the terms was wrong has been deleted - the terms are correct. - T. D. Noe, Apr 22 2009
More terms from Wesley Ivan Hurt, May 06 2014
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)