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.

A065982 a(n) = (n+1)*binomial(2*n,n) - 2^(2*n-1).

Original entry on oeis.org

2, 10, 48, 222, 1000, 4420, 19264, 83062, 355128, 1508028, 6368032, 26765420, 112053968, 467531272, 1945009408, 8070882982, 33414977368, 138067832332, 569466322528, 2345021291332, 9642649982128, 39598183143352, 162417965373568
Offset: 1

Views

Author

N. J. A. Sloane, Apr 12 2002

Keywords

Comments

Related to stable matchings.

References

  • E. G. Thurber, Concerning the maximum number of stable matchings ..., Discrete Math., 248 (2002), 195-219 (see I(2n)).

Programs

  • Mathematica
    Table[(n+1)Binomial[2n,n]-2^(2n-1),{n,30}] (* Harvey P. Dale, Jun 30 2024 *)
  • PARI
    a(n) = { (n + 1)*binomial(2*n, n) - 2^(2*n - 1) } \\ Harry J. Smith, Nov 05 2009