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

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,1

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)).

Links

Harry J. Smith, Table of n, a(n) for n = 1..150

Prog

(PARI) { for (n=1, 150, a=(n + 1)*binomial(2*n, n) - 2^(2*n - 1); write("b065982.txt", n, " ", a) ) } \\ Harry J. Smith, Nov 05 2009

Crossrefs

Sequence in context: A192696 A181296 A239073 * A114693 A086853 A036918

Adjacent sequences: A065979 A065980 A065981 * A065983 A065984 A065985

Keyword

nonn

Author

N. J. A. Sloane, Apr 12 2002

Status

approved