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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A342856 Factorial numbers n that are sqrt(n)-smooth. 0
 1, 24, 120, 720, 5040, 40320, 362880, 3628800, 39916800, 479001600, 6227020800, 87178291200, 1307674368000, 20922789888000, 355687428096000, 6402373705728000, 121645100408832000, 2432902008176640000, 51090942171709440000, 1124000727777607680000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS According to A007917, the largest prime factor of n! is the largest prime <= n. Because the factorials grow much faster than the squares, this sequence contains the factorial numbers except 2 and 6. - R. J. Mathar, Apr 07 2021 LINKS FORMULA Intersection of A000142 and A048098. E.g.f.: x*(5*x^3-13*x^2+9*x+1)/(1-x)^3. - Alois P. Heinz, Mar 25 2021 MATHEMATICA sqrtSmoothQ[n_] := FactorInteger[n][[-1, 1]] <= Sqrt[n]; Select[Range[25]!, sqrtSmoothQ] PROG first(n) = concat(1, vector(n-1, i, (i+3)!)) \\ David A. Corneth, Apr 07 2021 CROSSREFS Cf. A000142, A007917, A048098, A124657. Sequence in context: A052754 A050213 A124657 * A293050 A052581 A052605 Adjacent sequences:  A342853 A342854 A342855 * A342857 A342858 A342859 KEYWORD nonn AUTHOR Jean-François Alcover, Mar 25 2021 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.

Last modified June 23 07:00 EDT 2021. Contains 345395 sequences. (Running on oeis4.)