|
|
A162443
|
|
Numerators of the BG1[ -5,n] coefficients of the BG1 matrix
|
|
9
|
|
|
5, 66, 680, 2576, 33408, 14080, 545792, 481280, 29523968, 73465856, 27525120, 856162304, 1153433600, 18798870528, 86603988992, 2080374784, 2385854332928, 3216930504704, 71829033058304, 7593502179328, 281749854617600
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The BG1 matrix coefficients are defined by BG1[2m-1,1] = 2*beta(2m) and the recurrence relation BG1[2m-1,n] = BG1[2m-1,n-1] - BG1[2m-3,n-1]/(2*n-3)^2 with m = .. , -2, -1, 0, 1, 2, .. and n = 1, 2, 3, .. . As usual beta(m) = sum((-1)^k/(1+2*k)^m, k=0..infinity). For the BG2 matrix, the even counterpart of the BG1 matrix, see A008956.
We discovered that the n-th term of the row coefficients can be generated with BG1[1-2*m,n] = RBS1(1-2*m,n)* 4^(n-1)*((n-1)!)^2/ (2*n-2)! for m >= 1. For the BS1(1-2*m,n) polynomials see A160485.
The coefficients in the columns of the BG1 matrix, for m >= 1 and n >= 2, can be generated with GFB(z;n) = ((-1)^(n+1)*CFN2(z;n)*GFB(z;n=1) + BETA(z;n))/((2*n-3)!!)^2 for n >= 2. For the CFN2(z;n) and the Beta polynomials see A160480.
The BG1[ -5,n] sequence can be generated with the first Maple program and the BG1[2*m-1,n] matrix coefficients can be generated with the second Maple program.
The BG1 matrix is related to the BS1 matrix, see A160480 and the formulas below.
|
|
LINKS
|
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, Chapter 23, pp. 811-812.
|
|
FORMULA
|
a(n) = numer(BG1[ -5,n]) and A162444(n) = denom(BG1[ -5,n]) with BG1[ -5,n] = (1-8*n+12*n^2)*4^(n-1)*(n-1)!^2/(2*n-2)!.
The generating functions GFB(z;n) of the coefficients in the matrix columns are defined by
GFB(z;n) = sum(BG1[2*m-1,n]*z^(2*m-2), m=1..infinity).
GFB(z;n) = (1-z^2/(2*n-3)^2)*GFB(n-1) - 4^(n-2)*(n-2)!^2/((2*n-4)!*(2*n-3)^2) for n => 2 with GFB(z;n=1) = 1/(z*cos(Pi*z/2))*int(sin(z*t)/sin(t),t=0..Pi/2).
The column sums cs(n) = sum(BG1[2*m-1,n]*z^(2*m-2), m=1..infinity) = 4^(n-1)/((2*n-2)*binomial(2*n-2,n-1)) for n >= 2.
BG1[2*m-1,n] = (n-1)!^2*4^(n-1)*BS1[2*m-1,n]/(2*n-2)!
|
|
EXAMPLE
|
The first few formulas for the BG1[1-2*m,n] matrix coefficients are:
BG1[ -1,n] = (1)*4^(n-1)*(n-1)!^2/(2*n-2)!
BG1[ -3,n] = (1-2*n)*4^(n-1)*(n-1)!^2/(2*n-2)!
BG1[ -5,n] = (1-8*n+12*n^2)*4^(n-1)*(n-1)!^2/(2*n-2)!
The first few generating functions GFB(z;n) are:
GFB(z;2) = ((-1)*(z^2-1)*GFB(z;1) + (-1))/1
GFB(z;3) = ((+1)*(z^4-10*z^2+9)*GFB(z;1) + (-11 + z^2))/9
GFB(z;4) = ((-1)*( z^6- 35*z^4+259*z^2-225)*GFB(z;1) + (-299 + 36*z^2 - z^4))/225
|
|
MAPLE
|
a := proc(n): numer((1-8*n+12*n^2)*4^(n-1)*(n-1)!^2/(2*n-2)!) end proc: seq(a(n), n=1..21);
# End program 1
nmax1 := 5; coln := 3; Digits := 20: mmax1 := nmax1: for n from 0 to nmax1 do t2(n, 0) := 1 od: for n from 0 to nmax1 do t2(n, n) := doublefactorial(2*n-1)^2 od: for n from 1 to nmax1 do for m from 1 to n-1 do t2(n, m) := (2*n-1)^2* t2(n-1, m-1) + t2(n-1, m) od: od: for m from 1 to mmax1 do BG1[1-2*m, 1] := euler(2*m-2) od: for m from 1 to mmax1 do BG1[2*m-1, 1] := Re(evalf(2*sum((-1)^k1/(1+2*k1)^(2*m), k1=0..infinity))) od: for m from -mmax1 +coln to mmax1 do BG1[2*m-1, coln] := (-1)^(coln+1)*sum((-1)^k1*t2(coln-1, k1)*BG1[2*m-(2*coln-1)+2*k1, 1], k1=0..coln-1)/doublefactorial(2*coln-3)^2 od;
# End program 2
|
|
CROSSREFS
|
A162444 are the denominators of the BG1[ -5, n] matrix coefficients.
The BETA(z, n) polynomials and the BS1 matrix lead to the Beta triangle A160480.
The CFN2(z, n), the t2(n, m) and the BG2 matrix lead to A008956.
|
|
KEYWORD
|
easy,frac,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|