login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A005340
Number of ways in which n identical balls can be distributed among 7 boxes in a row such that each pair of adjacent boxes contains at least 4 balls.
(Formerly M4903)
5
1, 13, 76, 295, 889, 2188, 4652, 8891, 15686, 26011, 41056, 62251, 91291, 130162, 181168, 246959, 330560, 435401, 565348, 724735, 918397, 1151704, 1430596, 1761619, 2151962, 2609495, 3142808, 3761251, 4474975, 5294974, 6233128
OFFSET
12,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
Philippe Flajolet, Balls and Urns, etc., A problem in submarine detection (solution to problem 68-16).
M. Hayes (proposer) and D. R. Breach (solver), A combinatorial problem, Problem 68-16, SIAM Rev. 12 (1970), 294-297.
FORMULA
G.f.: x^12*(1 + 6*x + 6*x^2 + x^3 - 66*x^5 + 74*x^6 - 21*x^7)/(1-x)^7. - Vladeta Jovovic, Apr 13 2008
MATHEMATICA
f[x_] := x^12*(1 + 6*x + 6*x^2 + x^3 - 66*x^5 + 74*x^6 - 21*x^7)/(1-x)^7; Drop[ CoefficientList[ Series[f[x], {x, 0, 42}], x], 12] (* Jean-François Alcover, Oct 05 2011, after Vladeta Jovovic *)
CROSSREFS
KEYWORD
nonn,easy
EXTENSIONS
More terms from Vladeta Jovovic, Apr 13 2008
Name clarified by Alois P. Heinz, Oct 02 2017
STATUS
approved