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”).
%I #2 Mar 30 2012 17:27:11
%S 1,1,4,1,12,28,1,72,112,280,1,280,1400,1400,3640,1,1740,15120,21000,
%T 21840,58240,1,8484,126420,401800,382200,407680,1106560,1,57232,
%U 1538208,6370000,8357440,8153600,8852480,24344320,1
%N A partition product of Stirling_2 type [parameter k = -4] with biggest-part statistic (triangle read by rows).
%C Partition product of prod_{j=0..n-1}((k + 1)*j - 1) and n! at k = -4,
%C summed over parts with equal biggest part (see the Luschny link).
%C Underlying partition triangle is A134149.
%C Same partition product with length statistic is A035469.
%C Diagonal a(A000217) = A007559.
%C Row sum is A049119.
%H Peter Luschny, <a href="http://www.luschny.de/math/seq/CountingWithPartitions.html"> Counting with Partitions</a>.
%H Peter Luschny, <a href="http://www.luschny.de/math/seq/stirling2partitions.html"> Generalized Stirling_2 Triangles</a>.
%F T(n,0) = [n = 0] (Iverson notation) and for n > 0 and 1 <= m <= n
%F T(n,m) = Sum_{a} M(a)|f^a| where a = a_1,..,a_n such that
%F 1*a_1+2*a_2+...+n*a_n = n and max{a_i} = m, M(a) = n!/(a_1!*..*a_n!),
%F f^a = (f_1/1!)^a_1*..*(f_n/n!)^a_n and f_n = product_{j=0..n-1}(-3*j - 1).
%Y Cf. A157396, A157397, A157399, A157400, A080510, A157401, A157402, A157403, A157404, A157405
%K easy,nonn,tabl
%O 1,3
%A _Peter Luschny_, Mar 09 2009, Mar 14 2009