cp's OEIS Frontend

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.

A127426 a(n) = n! - ceiling(n^(n/2)).

Original entry on oeis.org

0, 0, 0, 0, 8, 64, 504, 4132, 36224, 343197, 3528800, 39382654, 476015616, 6209617492, 87072877696, 1307012632486, 20918494920704, 355658666311252, 6402175346437632, 121643693845767057, 2432891768176640000, 51090865734892274539, 1124000143459306268672
Offset: 0

Views

Author

N. J. A. Sloane, Apr 02 2007

Keywords

Comments

Theorem: n! > n^(n/2) for n >= 2 [Cauchy].

References

  • D. S. Mitrinovic, Analytic Inequalities, Springer-Verlag, 1970; p. 192, 3.1.14.

Programs

  • Mathematica
    Join[{0},Table[n!-Ceiling[n^(n/2)],{n,30}]] (* Harvey P. Dale, Jul 14 2018 *)