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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A172528 Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s. 0

%I

%S 1,1,1,1,2,3,3,1,3,8,19,38,60,60,1,4,15,53,175,535,1490,3675,7700,

%T 12600,12600,1,5,24,111,494,2111,8634,33635,123998,428820,1373820,

%U 4003230,10325700,22522500,37837800,37837800

%N Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s.

%C The row lengths are n(n+1)/2 +1 (A000124).

%F E.g.f. for row n is Product_m=0...n[Sum_i=0...m[x^i/i! ]].

%e T(3,2) = 8 because there are 8 two letter words that can be formed using the letters a,b,b,c,c,c: {a, b}, {a, c}, {b, a}, {b, b}, {b, c}, {c, a}, {c, b}, {c, c}.

%e Triangle Begins

%e 1;

%e 1,1;

%e 1,2,3,3;

%e 1,3,8,19,38,60,60;

%e 1,4,15,53,175,535,1490,3675,7700,12600,12600;

%t Table[CoefficientList[Series[Product[Sum[x^i/i!, {i, 0, n}], {n, 0, m}], {x,0, (m^2 + m)/2}], x]*Table[n!, {n, 0, (m^2 + m)/2}], {m, 0,5}] // Grid

%Y The last entry in row n is A022915(n).

%K nonn,tabf

%O 0,5

%A _Geoffrey Critzer_, Feb 06 2010

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

Last modified January 23 17:33 EST 2022. Contains 350514 sequences. (Running on oeis4.)