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

%I #11 Jun 30 2024 18:22:00

%S 2,10,48,222,1000,4420,19264,83062,355128,1508028,6368032,26765420,

%T 112053968,467531272,1945009408,8070882982,33414977368,138067832332,

%U 569466322528,2345021291332,9642649982128,39598183143352,162417965373568

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

%C Related to stable matchings.

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

%H Harry J. Smith, <a href="/A065982/b065982.txt">Table of n, a(n) for n = 1..150</a>

%t Table[(n+1)Binomial[2n,n]-2^(2n-1),{n,30}] (* _Harvey P. Dale_, Jun 30 2024 *)

%o (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

%K nonn

%O 1,1

%A _N. J. A. Sloane_, Apr 12 2002