This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A160485 Triangle of the RBS1 polynomial coefficients. 7
 1, 1, -2, 1, -8, 12, 1, -2, 60, -120, 1, -128, -168, 0, 1680, 1, 2638, 7320, -5040, -25200, -30240, 1, -98408, -300828, 52800, 1053360, 1330560, 665280, 1, 5307118, 17914260, 2522520, -56456400, -90810720, -60540480, -17297280 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 COMMENTS In A160480 we defined the BS1 matrix by BS1[2*m-1,n=1] = 2*beta(2*m) 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), for positive and negative values of m and n= 1, 2, .. . As usual beta(m) = sum((-1)^k/(1+2*k)^m, k=0..infinity). It is well-known that BS1[1-2*m,n=1] = euler(2*m-2) for m = 1, 2, .., with euler(2*m-2) the Euler numbers A000364. These values together with the recurrence relation lead to BS1[ -1,n] = 1 for n = 1, 2, .. . We discovered that the n-th term of the row coefficients BS1[1-2*m,n] for m = 1, 2, .., can be generated with the rather simple polynomials RBS1(1-2*m,n). Our discovery was enabled by the recurrence relation for the RBS1(1-2*m,n) polynomials which we derived from the recurrence relation for the BS[2*m-1,n] coefficients and the fact that RBS1(-1,n) = 1. The RBS1 polynomials and the polynomials defined by sequence A083061 are related by a shift of +-1/2 and scaling by a power of 2 (see arXiv link). - Richard P. Brent, Jul 15 2014 LINKS R. P. Brent, Generalising Tuenter's binomial sums, arXiv:1407.3533 [math.CO], 2014. R. B. Brent, Generalizing Tuenter's Binomial Sums, J. Int. Seq. 18 (2015) # 15.3.2 FORMULA RBS1(1-2*m,n) = (2*n-1)^2*RBS1(3-2*m,n)-(2*n)*(2*n-1)*RBS1(3-2*m,n+1) for m = 2, 3, .., with RBS1(-1,n) =1 for n = 1, 2, .. . EXAMPLE The first few rows of the triangle are: [1] [1, -2] [1, -8, 12] [1, -2, 60, -120] [1, -128, -168, 0, 1680] The first few RBS1(1-2*m,n) polynomials are: RBS1(-1,n) = 1 RBS1(-3,n) = 1 - 2*n RBS1(-5,n) = 1 - 8*n + 12*n^2 RBS1(-7,n) = 1 - 2*n + 60*n^2 - 120*n^3 MAPLE nmax := 8; mmax := nmax: A(1, 1) := 1: RBS1(n, 2) := (2*n-1)^2*1-(2*n)*(2*n-1)*1: for m from 3 to mmax do for k from 0 to m-1 do A(m-1, k+1) := coeff(RBS1(n, m-1), n, k) od; RBS1(n+1, m-1) := 0: for k from 0 to m-1 do RBS1(n+1, m-1) := RBS1(n+1, m-1) + A(m-1, k+1)*(n+1)^k od: RBS1(n, m) := (2*n-1)^2*RBS1(n, m-1)-(2*n)*(2*n-1) * RBS1(n+1, m-1) od: for k from 0 to nmax-1 do A(nmax, k+1) := coeff(RBS1(n, nmax), n, k) od: seq(seq(A(n, m), m=1..n), n=1..nmax); CROSSREFS A160480 is the Beta triangle. A009389(2*n) equals the second left hand column divided by 2. A001813 equals the first right hand column. The absolute values of the row sums equal the Euler numbers A000364. Cf. A083061. Sequence in context: A160614 A164662 A007026 * A118708 A055134 A137370 Adjacent sequences:  A160482 A160483 A160484 * A160486 A160487 A160488 KEYWORD easy,sign,tabl AUTHOR Johannes W. Meijer, May 24 2009, Jul 06 2009, Sep 19 2012 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 21 02:08 EDT 2018. Contains 313930 sequences. (Running on oeis4.)