A271040 Number of different 3 against 3 matches given n players.

0, 0, 0, 0, 0, 0, 10, 70, 280, 840, 2100, 4620, 9240, 17160, 30030, 50050, 80080, 123760, 185640, 271320, 387600, 542640, 746130, 1009470, 1345960, 1771000, 2302300, 2960100, 3767400, 4750200, 5937750, 7362810, 9061920, 11075680, 13449040, 16231600, 19477920

Offset

0,7

Comments

Given n players there are a(n) different ways of arranging those players in a 3 against 3 contest.

Number of ways to select two disjoint subsets of size 3 from a set of n elements. - Joerg Arndt, Mar 29 2016

Links

Colin Barker, Table of n, a(n) for n = 0..1000

Index entries for linear recurrences with constant coefficients, signature (7,-21,35,-35,21,-7,1).

Formula

a(n) = n*(n-1)*(n-2)*(n-3)*(n-4)*(n-5)/72.

a(n) = binomial(n,3) * binomial(n-3,3) / 2. - Joerg Arndt, Mar 29 2016

From Colin Barker, Mar 29 2016: (Start)

a(n) = 10*A000579(n).

a(n) = 7*a(n-1)-21*a(n-2)+35*a(n-3)-35*a(n-4)+21*a(n-5)-7*a(n-6)+a(n-7) for n>6.

G.f.: 10*x^6 / (1-x)^7.

(End)

Example

When there are 6 players, there are 10 different 3 against 3 matches that can be played: ABC v DEF, ABD v CEF, ABE v CDF, ABF v CDE, ACD v BEF, ACE v BDF, ACF v BDE, ADE v BCF, ADF v BCE, AEF v BCD.

Mathematica

LinearRecurrence[{7, -21, 35, -35, 21, -7, 1}, {0, 0, 0, 0, 0, 0, 10}, 40] (* Harvey P. Dale, Sep 17 2016 *)

Prog

(PARI) concat(vector(6), Vec(10*x^6/(1-x)^7 + O(x^50))) \\ Colin Barker, Mar 29 2016
(PARI) a(n)=binomial(n, 3)*binomial(n-3, 3)/2 \\ Charles R Greathouse IV, May 22 2018

Crossrefs

Cf. A050534, the analogous situation for 2 against 2 matches.

Sequence in context: A160662 A090084 A025221 * A005567 A174434 A073391

Adjacent sequences: A271037 A271038 A271039 * A271041 A271042 A271043

Keyword

nonn,easy

Author

Elliott Line, Mar 29 2016

Status

approved