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.

A127691 a(n) = (2*n+1)^n-(2*n-1)^n-(2*n)^n.

Original entry on oeis.org

-1, 0, 0, 2, 64, 2002, 69264, 2697354, 117899520, 5740530914, 308814720400, 18213955960378, 1169672907313728, 81286160430474066, 6080123714344570128, 487166244246501489002, 41636260100744439399424, 3781449867356996500139458, 363724112817207189865471248
Offset: 0

Views

Author

N. J. A. Sloane, Apr 03 2007

Keywords

Comments

Theorem: (2*n+1)^n-(2*n-1)^n-(2*n)^n > 0 for n >= 3.

References

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