OFFSET
0,2
COMMENTS
Number of placing of at least n objects but no more than 3*n distinct objects in n distinct boxes with the condition that in each box there is at least 1 object but no more than 3. - Adi Dani, May 04 2011
LINKS
David Applegate and N. J. A. Sloane, Table of n, a(n) for n = 0..100
Samuele Giraudo and Yannic Vargas, Operads of packed words, quotients, and monomial bases, Proc. 37th Conf. Formal Power Series Alg. Comb., Sém. Lotharingien Combin. (2025) Vol. 93B Art. No. 82. See p. 9.
MATHEMATICA
t[n_, n_] = 1; t[n_ /; n >= 0, k_] /; 0 <= k <= 3*n := t[n, k] = t[n - 1, k - 1] + (k - 1)*t[n - 1, k - 2] + (1/2)*(k - 1)*(k - 2)*t[n - 1, k - 3]; t[_, _] = 0; a[n_] := Sum[t[n, k], {k, 0, 3*n}]; Table[n!*a[n], {n, 0, 20}] (* Michael De Vlieger, Aug 04 2025, after Jean-François Alcover at A144416 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
David Applegate and N. J. A. Sloane, Dec 08 2008, corrected Jan 14 2009
STATUS
approved
