This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A214078 #30 Jan 20 2024 11:29:06
%S A214078 1,1,2,2,2,6,6,6,6,6,24,24,24,24,24,24,24,120,120,120,120,120,120,120,
%T A214078 120,120,720,720,720,720,720,720,720,720,720,720,720,5040,5040,5040,
%U A214078 5040,5040,5040,5040,5040,5040,5040,5040,5040,5040,40320,40320,40320
%N A214078 a(n) = (ceiling (sqrt(n)))!.
%H A214078 Vincenzo Librandi, <a href="/A214078/b214078.txt">Table of n, a(n) for n = 0..1000</a>
%F A214078 a(n) = A000142(A003059(n)). - _Michel Marcus_, Jul 28 2022
%F A214078 Sum_{n>=0} 1/a(n) = e + 2. - _Amiram Eldar_, Aug 15 2022
%t A214078 Table[Ceiling[Sqrt[n]]!, {n, 0, 50}] (* _T. D. Noe_, Dec 23 2012 *)
%o A214078 (Derive) PROG(y := [], n := 50, LOOP(IF(n = -1, RETURN y), y := ADJOIN(CEILING(SQRT(n))!, y), n := n - 1))
%o A214078 (Magma) [Factorial(Ceiling (Sqrt(n))): n in [0..50]]; // _Vincenzo Librandi_, Feb 13 2013
%o A214078 (PARI) a(n) = ceil(sqrt(n))!; \\ _Altug Alkan_, Jan 11 2016
%o A214078 (Python)
%o A214078 from math import factorial, isqrt
%o A214078 def A214078(n): return factorial(1+isqrt(n-1)) if n else 1 # _Chai Wah Wu_, Jul 28 2022
%Y A214078 Cf. A214078, A214079, A214080, A214081, A214083, A055228, A055226.
%Y A214078 Cf. A000142, A003059.
%K A214078 easy,nonn
%O A214078 0,3
%A A214078 _Mohammad K. Azarian_, Dec 22 2012