|
Search: id:A065982
|
|
|
| A065982 |
|
(n+1)*binomial(2*n,n)-2^(2*n-1). |
|
+0
2
|
|
| 2, 10, 48, 222, 1000, 4420, 19264, 83062, 355128, 1508028, 6368032, 26765420, 112053968, 467531272, 1945009408, 8070882982, 33414977368, 138067832332, 569466322528, 2345021291332, 9642649982128, 39598183143352, 162417965373568
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
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
|
|
PROGRAM
|
(PARI) { for (n=1, 150, a=(n + 1)*binomial(2*n, n) - 2^(2*n - 1); write("b065982.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Nov 05 2009]
|
|
CROSSREFS
|
Sequence in context: A009316 A116194 A054138 this_sequence A114693 A121950 A086853
Adjacent sequences: A065979 A065980 A065981 this_sequence A065983 A065984 A065985
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Apr 12 2002
|
|
|
Search completed in 0.002 seconds
|
