0,2

For v>=1 the orthogonal polynomials pt(n,v,x) have only integer zeros k*(k+1), k=1..n These integer zeros are from 2*A000217.

Coefficients of pt(n,v=n,x) (in the quoted Bruschi et al. paper {\tilde p}^{(\nu)}_n(x) of eqs. (20) and (24a),(24b)) in increasing powers of x.

The v-family pt(n,v,x) consists of characteristic polynomials of the tridiagonal M x M matrix Vt=Vt(M,v) with entries Vt_{m,n} given by 2*m*(v+1-m) if n=m, m=1,...,M; -m*(v+1-m) if n=m-1, m=2,...,M; -m*(v+1-m) if n=m+1, m=1..M-1 and 0 else. pt(n,v,x):=det(x*I_n-Vt(n,v) with the n dimensional unit matrix I_n.

pt(n,v=n,x) has, for every n>=1, the n integer zeros 2,6,12,...,n*(n+1). pt(2,2,x) has therefore only the integer zeros 2 and 6. 12= 2*6 = det(Vt(2,2))=16-4.

This triangle coincides with triangle A129467 without row n=0 and column m=0, taking as offset again [0,0].

Column sequences give for m=0..2: A010790(n-1)*(-1)^(n-1), A084915(n+1)*(-1)^n, A130033.

M. Bruschi, F. Calogero and R. Droghei, Proof of certain Diophantine conjectures and identification of remarkable classes of orthogonal polynomials, J. Physics A, 40(2007)3815-3829.

W. Lang, First 10 rows and more.

a(n,m)=[x^m]pt(n,n,x), n>=0, with the three term recurrence for orthogonal polynomial systems of the form pt(n,v,x) = (x + 2*n*(n-1-v)*pt(n-1,v,x) -(n-1)*n*(n-1-v)*(n-2-v)*pt(n-2,v,x), n>=1; pt(-1,v,x)=0 and pt(0,v,x)=1. Start with v=n.

n=2: [12,-8,1 stands for pt(2,2,x)=12-8*x+x^2 = (x-2)*(x-6) with the integer zeros 2*1 and 2*3.

[1]; [ -2,1]; [12,-8,1]; [ -144,108,-20,1]; [2880,-2304,508,-40,1]; ...

Row sums give A130031(n+1), n>=0. Unsigned row sums give A130032(n+1), n>=1.

Cf. A130182 (v=1 member).

Sequence in context: A074966 A128413 A058843 this_sequence A135256 A090586 A048854

Adjacent sequences: A130556 A130557 A130558 this_sequence A130560 A130561 A130562

sign,tabl,easy

Wolfdieter Lang (wolfdieter.lang(AT)physik.uni-karlsruhe.de) Jul 13 2007