|
%I #23 Dec 13 2013 03:14:00
%S 1,-1,1,5,-2,1,-1,5,-3,1,1,-2,5,-4,1,1,1,-5,25,-5,1,-5,1,3,-10,25,-6,
%T 1,-1,-5,7,7,-35,35,-7,1,7,-4,-10,28,7,-28,70,-8,1,3,21,-6,-10,21,63,
%U -42,30,-9,1,-15,3,21,-20,-25,42,21,-60,75,-10,1,-5,-15,33,77,-55,-55,77,33,-165,275,-11,1,7601,-10,-45,66,231,-132,-110,132,99,-110,55,-12,1
%N Triangle with the numerator of the coefficient [x^k] of the second order Bernoulli polynomial B_n^(2)(x) in row n, column 0<=k<=n.
%C The a-th order Bernoulli polynomials are defined via the exponential generating function (t/(exp t -1))^a*exp(x*t) = sum_{n>=0} B_n^(a)(x) * t^n/n!. The current triangular array shows the coefficient [x^k] of B_n^(2)(x), i.e. the expansion coefficients in rising powers of the polynomial of x with a=2.
%C P(n,x) = 2*sum(m=0..n-1, binomial(n,m)*sum(k=1..n-m, stirling2(n-m,k) * stirling1(2+k,2)/((k+1)*(k+2))))*x^m+x^n. - _Vladimir Kruchinin_, Oct 23 2011]
%H R. Dere, Y. Simsek, <a href="http://arxiv.org/abs/1110.1484">Bernoulli type polynomials on Umbral Algebra</a>, arXiv:1110.1484 [math.CA]
%H V. Kruchinin, D. Kruchinin, <a href="http://arxiv.org/abs/1211.0099">Application of a composition of generating functions for obtaining explicit formulas of polynomials</a>, arXiv: 1211.0099
%F T(n,m) = sum(2*C(n,m)*sum(k=1..n-m, stirling2(n-m,k)*stirling1(2+k,2)/ ((k+1)*(2+k)))), m<n, T(n,n)=1. - _Vladimir Kruchinin_, Oct 23 2011
%e The table of the coefficients is
%e 1;
%e -1,1;
%e 5/6,-2,1; 5/6-2x+x^2
%e -1/2,5/2,-3,1; -1/2+5x/2-3x^2+x^3
%e 1/10,-2,5,-4,1;
%e 1/6,1/2,-5,25/3,-5,1;
%e -5/42,1,3/2,-10,25/2,-6,1;
%e -1/6,-5/6,7/2,7/2,-35/2,35/2,-7,1;
%e 7/30,-4/3,-10/3,28/3,7,-28,70/3,-8,1;
%e 3/10,21/10,-6,-10,21,63/5,-42,30,-9,1;
%e -15/22,3,21/2,-20,-25,42,21,-60,75/2,-10,1;
%e -5/6,-15/2,33/2,77/2,-55,-55,77,33,-165/2,275/6,-11,1;
%e 7601/2730,-10,-45,66,231/2,-132,-110,132,99/2,-110,55,-12,1;
%p A197419 := proc(n,k)
%p local a,Bt,Bnx,o ,t,x;
%p a := 2 ;
%p Bt := (t/(exp(t)-1))^a*exp(x*t) ;
%p Bnx := n!*coeftayl(Bt,t=0,n) ;
%p coeftayl(Bnx,x=0,k) ;
%p numer(%) ;
%p end proc:
%p seq(seq(A197419(n,k),k=0..n),n=0..4) ; # print row by row
%t t[n_, m_] := If [n == m, 1, 2*Binomial[n, m]*Sum[StirlingS2[n-m, k]*StirlingS1[2+k, 2]/((k+1)*(2+k)), {k, 1, n-m}]]; Table[t[n, m] // Numerator, {n, 0, 12}, {m, 0, n}] // Flatten (* _Jean-François Alcover_, Dec 12 2013, after _Vladimir Kruchinin_ *)
%o (Maxima) T(n,m):=num(if n=m then 1 else 2*binomial(n,m)* sum(stirling2(n-m,k) *stirling1(2+k,2)/ ((k+1)*(2+k)),k,1,n-m)); [From _Vladimir Kruchinin_, Oct 23 2011]
%Y Cf. A197420 (denominator), A100616, A100615 (column k=0).
%K sign,tabl,frac
%O 0,4
%A _R. J. Mathar_, Oct 14 2011
|
