|
%I #26 Aug 28 2019 17:10:14
%S 1,1,1,1,2,1,1,3,3,1,1,2,1,2,1,1,1,2,1,1,1,1,6,15,3,15,30,1,1,1,3,3,3,
%T 1,1,1,1,2,1,1,5,2,5,10,1,1,3,2,7,1,3,42,21,21,1,1,2,3,2,1,6,15,3,5,
%U 10,1,1,1,5,3,10,5,15,5,5,1,1,1,1,6,3,2,3,3,7,1,1,14,21,42,1,1,1,2,1,1,1,1,1
%N Triangle of denominators of coefficients of Faulhaber polynomials in Knuth's version.
%C The companion triangle with the numerators is A093556, where more information can be found.
%H A. Dzhumadil'daev, D. Yeliussizov, <a href="http://cs.uwaterloo.ca/journals/JIS/VOL16/Yeliussizov/dzhuma6.html">Power sums of binomial coefficients</a>, Journal of Integer Sequences, 16 (2013), Article 13.1.4.
%H W. Lang, <a href="/A093557/a093557.txt">First 10 rows</a>.
%H D. Yeliussizov, <a href="https://web.archive.org/web/20160927104833/http://www.kazntu.kz/sites/default/files/20121221ND_Eleusizov.pdf">Permutation Statistics on Multisets</a>, Ph.D. Dissertation, Computer Science, Kazakh-British Technical University, 2012.
%F a(m, k) = denominator(A(m, k)) with recursion: A(m, 0)=1, A(m, k)=-(sum(binomial(m-j, 2*k+1-2*j)*A(m, j), j=0..k-1))/(m-k) if 0<= k <= m-1, else 0. From the 1993 Knuth reference, given in A093556, p. 288, eq.(*) with A^{(m)}_k = A(m, k).
%e Triangle begins:
%e [1];
%e [1,1];
%e [1,2,1];
%e [1,3,3,1];
%e ...
%e Denominators of [1]; [1,0]; [1,-1/2,0]; [1,-4/3,2/3,0]; ... (see W. Lang link in A093556.)
%t a[m_, k_] := (-1)^(m-k)* Sum[ Binomial[2*m, m-k-j]*Binomial[m-k+j, j]*((m-k-j)/(m-k+j))*BernoulliB[m+k+j], {j, 0, m-k}]; Flatten[ Table[ Denominator[a[m, k]], {m, 1, 14}, {k, 0, m-1}]] (* _Jean-François Alcover_, Oct 25 2011 *)
%K nonn,frac,tabl,easy
%O 1,5
%A _Wolfdieter Lang_, Apr 02 2004
|
