A272352 a(n) is the number of ways of putting n labeled balls into 2 indistinguishable boxes such that each box contains at least 3 balls.

10, 35, 91, 210, 456, 957, 1969, 4004, 8086, 16263, 32631, 65382, 130900, 261953, 524077, 1048344, 2096898, 4194027, 8388307, 16776890, 33554080, 67108485, 134217321, 268435020, 536870446, 1073741327, 2147483119, 4294966734, 8589933996, 17179868553

Offset

6,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 6..1000

I. Mezo, Periodicity of the last digits of some combinatorial sequences, arXiv preprint arXiv:1308.1637 [math.CO], 2013 (page 16).

Index entries for linear recurrences with constant coefficients, signature (5,-9,7,-2).

Formula

G.f.: x^6*(10 - 15*x + 6*x^2)/((1 - x)^3*(1 - 2*x)).

a(n) = (2^n - 2 - 2*n - 2*binomial(n, 2))/2.

a(n) = 5*a(n-1) - 9*a(n-2) + 7*a(n-3) - 2*a(n-4), for n > 3.

E.g.f.: (2 - 2*exp(x) + 2*x + x^2)^2/8. - Stefano Spezia, Jul 25 2021

Example

For n=6, label the balls A, B, C, D, E, and F. Then each box must contain exactly 3 balls, and the 10 ways are ABC/DEF, ABD/CEF, ABE/CDF, ABF/CDE, ACD/BEF, ACE/BDF, ACF/BDE, ADE/BCF, ADF/BCE, AEF/BCD. - Michael B. Porter, Jul 01 2016

Mathematica

Table[1/2 (2^n - 2 - 2 n - 2 Binomial[n, 2]), {n, 6, 40}]
LinearRecurrence[{5, -9, 7, -2}, {10, 35, 91, 210}, 30] (* Harvey P. Dale, Mar 29 2018 *)

Prog

(Magma) [(2^n-2-2*n-2*Binomial(n, 2))/2: n in [6..50]];

Crossrefs

Cf. A000478, A058844, A261724, A272982, column 2 of A059022.

Column k=3 of A201385 (shifted).

Sequence in context: A000447 A052472 A331429 * A358248 A309883 A049736

Adjacent sequences: A272349 A272350 A272351 * A272353 A272354 A272355

Keyword

nonn,easy

Author

Vincenzo Librandi, May 11 2016

Status

approved