A130813 If X_1,...,X_n is a partition of a 2n-set X into 2-blocks then a(n) is equal to the number of 7-subsets of X containing none of X_i, (i=1,...n).

128, 1024, 4608, 15360, 42240, 101376, 219648, 439296, 823680, 1464320, 2489344, 4073472, 6449664, 9922560, 14883840, 21829632, 31380096, 44301312, 61529600, 84198400, 113667840, 151557120, 199779840, 260582400, 336585600, 430829568

Offset

7,1

Comments

Number of n permutations (n>=7) of 3 objects u,v,z, with repetition allowed, containing n-7 u's. Example: if n=7 then n-7 =(0) zero u, a(1)=128. - Zerinvary Lajos, Aug 05 2008

a(n) is the number of 6-dimensional elements in an n-cross polytope where n>=7. - Patrick J. McNab, Jul 06 2015

Links

Table of n, a(n) for n=7..32.

Milan Janjic, Two Enumerative Functions

Eric Weisstein's World of Mathematics, Cross Polytope

Formula

a(n) = binomial(2*n,7) + binomial(n,2)*binomial(2*n-4,3) - n*binomial(2*n-2,5) - (2*n-6)*binomial(n,3).

a(n) = C(n,n-7)*2^7, n>=7. - Zerinvary Lajos, Dec 07 2007

G.f.: 128*x^7/(1-x)^8. - Colin Barker, Mar 18 2012

a(n) = 128*A000580(n). a(n+1) = 2*(n+1)*a(n)/(n-6) for n >= 7. - Robert Israel, Jul 08 2015

Maple

a:=n->binomial(2*n, 7)+binomial(n, 2)*binomial(2*n-4, 3)-n*binomial(2*n-2, 5)-(2*n-6)*binomial(n, 3);
seq(binomial(n, n-7)*2^7, n=7..32); # Zerinvary Lajos, Dec 07 2007
seq(binomial(n+6, 7)*2^7, n=1..22); # Zerinvary Lajos, Aug 05 2008

Mathematica

Table[Binomial[n, n - 7] 2^7, {n, 7, 40}] (* Vincenzo Librandi, Jul 09 2015 *)

Prog

(Magma) [Binomial(n, n-7)*2^7: n in [7..40]]; // Vincenzo Librandi, Jul 09 2015

Crossrefs

Cf. A038207, A000079, A001787, A001788, A001789, A003472, A054849, A002409, A054851, A140325, A140354, A046092, A130809, A130810, A130811, A130812. - Zerinvary Lajos, Aug 05 2008

Cf. A000580.

Sequence in context: A183976 A183972 A143708 * A206278 A100628 A344303

Adjacent sequences: A130810 A130811 A130812 * A130814 A130815 A130816

Keyword

nonn

Author

Milan Janjic, Jul 16 2007

Status

approved