login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

a(n) = n!*A144416(n).
4

%I #12 Feb 12 2014 21:21:37

%S 1,3,62,5052,1087104,487424520,393702654960,519740602925040,

%T 1046019551260199040,3046052768591313895680,

%U 12322848899623787148556800,67036205966744406283600262400,477463744343745629221074425625600,4354451197836949908463868034925593600

%N a(n) = n!*A144416(n).

%C 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

%H David Applegate and N. J. A. Sloane, <a href="/A144422/b144422.txt">Table of n, a(n) for n = 0..100</a>

%K nonn

%O 0,2

%A _David Applegate_ and _N. J. A. Sloane_, Dec 08 2008, corrected Jan 14 2009