VOOZH about

URL: https://oeis.org/A259975

⇱ A259975 - OEIS

login
A259975
Irregular triangle read by rows: T(n,k) = number of ways of placing n balls into k boxes in such a way that any two adjacent boxes contain at least 4 balls.
3
1, 1, 1, 1, 1, 5, 1, 1, 6, 4, 1, 7, 9, 1, 8, 16, 1, 9, 25, 15, 1, 1, 10, 35, 40, 8, 1, 11, 46, 76, 31, 1, 12, 58, 124, 85, 1, 13, 71, 185, 190, 35, 1, 1, 14, 85, 260, 360, 154, 13, 1, 15, 100, 350, 610, 424, 76, 1, 16, 116, 456, 956, 930, 295
OFFSET
0,6
LINKS
R. P. Boas & N. J. A. Sloane, Correspondence, 1974
M. Hayes (proposer) and D. R. Breach (solver), A combinatorial problem, Problem 68-16, SIAM Rev. 12 (1970), 294-297.
EXAMPLE
Triangle begins:
1;
1;
1;
1;
1, 5, 1;
1, 6, 4;
1, 7, 9;
1, 8, 16;
1, 9, 25, 15, 1;
1, 10, 35, 40, 8;
1, 11, 46, 76, 31;
1, 12, 58, 124, 85;
1, 13, 71, 185, 190, 35, 1;
1, 14, 85, 260, 360, 154, 13;
1, 15, 100, 350, 610, 424, 76;
...
MAPLE
b:= proc(n, v) option remember; expand(`if`(n=0,
`if`(v=0, 1+x, 1), add(x*b(n-j, max(0, 4-j)), j=v..n)))
end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(b(n, 0)):
seq(T(n), n=0..20); # Alois P. Heinz, Jul 12 2015
MATHEMATICA
b[n_, v_] := b[n, v] = Expand[If[n == 0, If[v == 0, 1+x, 1], Sum[x*b[n-j, Max[0, 4-j]], {j, v, n}]]]; T[n_] := Function[p, Table[Coefficient[p, x, i], {i, 1, Exponent[p, x]}]][b[n, 0]]; Table[T[n], {n, 0, 20}] // Flatten (* Jean-François Alcover, Feb 13 2016, after Alois P. Heinz *)
CROSSREFS
Row sums give A257666.
Sequence in context: A209575 A159570 A280374 * A028313 A173119 A050178
KEYWORD
nonn,tabf
AUTHOR
N. J. A. Sloane, Jul 12 2015
EXTENSIONS
More terms from Alois P. Heinz, Jul 12 2015
STATUS
approved