cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A254881 Triangle read by rows, T(n,k) = sum(j=0..k-1, S(n+1,j+1)*S(n,k-j)) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n.

This page as a plain text file.
%I A254881 #21 Mar 25 2015 08:37:13
%S A254881 1,0,1,1,0,2,5,4,1,0,12,40,51,31,9,1,0,144,564,904,769,376,106,16,1,0,
%T A254881 2880,12576,23300,24080,15345,6273,1650,270,25,1,0,86400,408960,
%U A254881 840216,991276,748530,381065,133848,32523,5370,575,36,1,0,3628800,18299520
%N A254881 Triangle read by rows, T(n,k) = sum(j=0..k-1, S(n+1,j+1)*S(n,k-j)) where S denotes the Stirling cycle numbers A132393, T(0,0)=1, n>=0, 0<=k<=2n.
%C A254881 These are also the coefficients of the polynomials interpolating the sequence k -> n!*((n+k)!/k!)*binomial(n+k-1,k-1) (for fixed n>=0). Divided by n! these polynomials generate the rows of Lah numbers L(n+k, k) = ((n+k)!/k!)* binomial(n+k-1,k-1).
%F A254881 T(n, n) = A187235(n) for n>=1 (after the explicit formula of _Vaclav Kotesovec_).
%e A254881 [1]
%e A254881 [0, 1, 1]
%e A254881 [0, 2, 5, 4, 1]
%e A254881 [0, 12, 40, 51, 31, 9, 1]
%e A254881 [0, 144, 564, 904, 769, 376, 106, 16, 1]
%e A254881 [0, 2880, 12576, 23300, 24080, 15345, 6273, 1650, 270, 25, 1]
%e A254881 For example in the case n=3 the polynomial (k^6+9*k^5+31*k^4+51*k^3+40*k^2+12*k)/3! generates the Lah numbers 0, 24, 240, 1200, 4200, 11760, 28224, ... (A253285).
%p A254881 # This is a special case of the recurrence given in A246117.
%p A254881 t := proc(n,k) option remember; if n=0 and k=0 then 1 elif
%p A254881 k <= 0 or k>n then 0 else iquo(n,2)*t(n-1,k)+t(n-1,k-1) fi end:
%p A254881 A254881 := (n,k) -> t(2*n,k):
%p A254881 seq(print(seq(A254881(n,k), k=0..2*n)), n=0..5);
%p A254881 # Illustrating the comment:
%p A254881 restart: with(PolynomialTools): with(CurveFitting): for N from 0 to 5 do
%p A254881 CoefficientList(PolynomialInterpolation([seq([k,N!*((N+k)!/k!)*binomial(N+k-1,k-1)], k=0..2*N)], n), n) od;
%t A254881 Flatten[{1,Table[Table[Sum[Abs[StirlingS1[n+1,j+1]] * Abs[StirlingS1[n,k-j]],{j,0,k-1}],{k,0,2*n}],{n,1,10}]}] (* _Vaclav Kotesovec_, Feb 10 2015 *)
%o A254881 (Sage)
%o A254881 def T(n,k):
%o A254881     if n == 0: return 1
%o A254881     return sum(stirling_number1(n+1,j+1)*stirling_number1(n,k-j) for j in range(k))
%o A254881 for n in range (6): [T(n,k) for k in (0..2*n)]
%Y A254881 Cf. A246117, A254882, A187235.
%Y A254881 The sequences A000012, A002378, A083374, A253285 are the Lah number rows generated by the polynomials divided by n! for n=0, 1, 2, 3 respectivly.
%K A254881 nonn,tabf
%O A254881 0,6
%A A254881 _Peter Luschny_, Feb 10 2015