login

Revision History for A160480

(Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
The Beta triangle read by rows.
(history; published version)
#31 by Michael De Vlieger at Fri May 05 07:47:48 EDT 2023
STATUS

proposed

approved

#30 by Jon E. Schoenfield at Fri May 05 05:03:48 EDT 2023
STATUS

editing

proposed

Discussion
Fri May 05
07:47
Michael De Vlieger: A little less bad is more good.
#29 by Jon E. Schoenfield at Fri May 05 05:03:18 EDT 2023
COMMENTS

The coefficients of the BS1 matrix are defined by BS1[2*m-1,n] = int(y^(2*m-1)/(cosh(y))^(2*n-1),y=0..infinity)/factorial(2*m-1) for m = 1, 2, .. . and n = 1, 2, .. . .

This definition leads to BS1[2*m-1,n=1] = 2*beta(2*m), for m = 1, 2, .. , ., and the recurrence relation BS1 [2*m-1,n] = (2*n-3)/(2*n-2)*(BS1[2*m-1,n-1] - BS1[2*m-3,n-1]/(2*n-3)^2) which we used to extend our definition of the BS1 matrix coefficients to m = 0, -1, -2, .. . . We discovered that BS1[ -1,n] = 1 for n = 1, 2, .. . . As usual beta(m) = sum((-1)^k/(1+2*k)^m, k=0..infinity).

The coefficients in the columns of the BS1 matrix, for m = 1, 2, 3, .. , ., and n = 2, 3, 4 , ... , , can be generated with the GK(z;n) polynomials for which we found the following general expression GK(z;n) = ((-1)^(n+1)*CFN2(z;n)*GK(z;n=1) + BETA(z;n))/p(n).

The first Maple algorithm generates the coefficients of the Beta triangle. The second Maple algorithm generates the BS1[2*m-1,n] coefficients for m = 0, -1, -2, -3, .. . .

FORMULA

We discovered a relation between the Beta triangle coefficients BETA(n,m) = (2*n-3)^2* BETA(n-1,m)- BETA(n-1,m-1) for n = 3, 4, .. . and m = 2, 3, .. . with BETA(n,m=1) = (2*n-3)^2* BETA(n-1,m=1) - (2*n-4)! for n = 2, 3, .. . and BETA(n,n) = 0 for n = 1, 2, .. . .

GK(z;n) = sum(BS1[2*m-1,n]*z^(2*m-2), m=1..infinity) with n = 1, 2, .. . .

Furthermore we discovered that GK(z;n) = GK(z;n-1)*((2*n-3)/(2*n-2)-z^2/((2*n-2)*(2*n-3)))-1/((2*n-2)*(2*n-3)) for n = 2, 3 , , ... .

We found the following general expression for the GK(z;n) polynomials, for n = 2, 3, .. ,.,

EXAMPLE

The first few rows of the triangle BETA(n,m) with n=2,3,.. . and m=1,2,.. . are

[ -1],

[ -11, 1],

[ -299, 36, -1],

[ -15371, 2063 -85, 1].

BETA(z;n=2) = -1,

BETA(z;n=3) = -11 + z^2,

BETA(z;n=4) = -299 + 36*z^2 - z^4.

CFN2(z;n=2) = (z^2 - 1),

CFN2(z;n=3) = (z^4 - 10*z^2 + 9),

CFN2(z;n=4) = (z^6 - 35*z^4 + 259*z^2 - 225).

The first few generating functions GK(z;n) are:

GK(z;n=2) = ((-1)*(z^2-1)*GK(z,n=1) + (-1))/2,

GK(z;n=3) = ((z^4 - 10*z^2 + 9)*GK(z,n=1)+ (-11 + z^2))/24,

GK(z;n=4) = ((-1)*( z^6 - 35*z^4 + 259*z^2 - 225)*GK(z,n=1) + (-299 + 36*z^2 - z^4))/720.

CROSSREFS

A160481 equals the rows sums .

Cf. A162443 (BG1 matrix).

STATUS

approved

editing

Discussion
Fri May 05
05:03
Jon E. Schoenfield: (Still uned, but a little less bad.)
#28 by Michael De Vlieger at Sat Apr 22 07:13:49 EDT 2023
STATUS

reviewed

approved

#27 by Michel Marcus at Sat Apr 22 01:44:14 EDT 2023
STATUS

proposed

reviewed

#26 by Joerg Arndt at Fri Apr 21 11:32:05 EDT 2023
STATUS

editing

proposed

#25 by Joerg Arndt at Fri Apr 21 11:31:16 EDT 2023
MATHEMATICA

BETA[2, 1] = -1;

BETA[2, 1] = -1; BETA[n_, 1] := BETA[n, 1] = (2*n - 3)^2*BETA[n - 1, 1] - (2*n - 4)!; BETA[n_ /; n > 2, m_ /; m > 0] /; 1 <= m <= n := BETA[n, m] = (2*n - 3)^2*BETA[n - 1, m] - BETA[n - 1, m - 1]; BETA[_, _] = 0;

BETA[n_ /; n > 2, m_ /; m > 0] /; 1 <= m <= n := BETA[n, m] = (2*n - 3)^2*BETA[n - 1, m] - BETA[n - 1, m - 1];

BETA[_, _] = 0;

KEYWORD

uned,easy,sign,tabl

STATUS

approved

editing

Discussion
Fri Apr 21
11:32
Joerg Arndt: "uned"; Mathca code might be useful foe un-uned-ing this one.
#24 by Michael De Vlieger at Mon Feb 28 07:56:06 EST 2022
STATUS

reviewed

approved

#23 by Joerg Arndt at Mon Feb 28 04:10:43 EST 2022
STATUS

proposed

reviewed

#22 by Michel Marcus at Mon Feb 28 02:19:41 EST 2022
STATUS

editing

proposed