login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A157401 A partition product of Stirling_2 type [parameter k = 1] with biggest-part statistic (triangle read by rows). 10

%I #2 Mar 30 2012 17:27:11

%S 1,1,1,1,1,3,3,1,9,12,15,1,25,60,75,105,1,75,330,450,630,945,1,231,

%T 1680,3675,4410,6615,10395,1,763,9408,30975,41160,52920,83160,135135,

%U 1,2619,56952,233415,489510,555660,748440,1216215

%N A partition product of Stirling_2 type [parameter k = 1] 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 = 1,

%C summed over parts with equal biggest part (see the Luschny link).

%C Underlying partition triangle is A143171.

%C Same partition product with length statistic is A001497.

%C Diagonal a(A000217) = A001147.

%C Row sum is A001515.

%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}(2*j - 1).

%Y Cf. A157396, A157397, A157398, A157399, A157400, A080510, A157402, A157403, A157404, A157405

%K easy,nonn,tabl

%O 1,6

%A _Peter Luschny_, Mar 09 2009, Mar 14 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 04:58 EDT 2024. Contains 370952 sequences. (Running on oeis4.)