Search Results for ""

The Euler polynomial E_n(x) is given by the Appell sequence with g(t)=1/2(e^t+1), (1) giving the generating function (2e^(xt))/(e^t+1)=sum_(n=0)^inftyE_n(x)(t^n)/(n!). (2) ...

The orthogonal polynomials defined by h_n^((alpha,beta))(x,N)=((-1)^n(N-x-n)_n(beta+x+1)_n)/(n!) ×_3F_2(-n,-x,alpha+N-x; N-x-n,-beta-x-n;1) =((-1)^n(N-n)_n(beta+1)_n)/(n!) ...

Let alpha(x) be a step function with the jump j(x)=(N; x)p^xq^(N-x) (1) at x=0, 1, ..., N, where p>0,q>0, and p+q=1. Then the Krawtchouk polynomial is defined by ...

Polynomials s_k(x;lambda,mu) which are a generalization of the Boole polynomials, form the Sheffer sequence for g(t) = (1+e^(lambdat))^mu (1) f(t) = e^t-1 (2) and have ...

Polynomials s_k(x;a) which form the Sheffer sequence for g(t) = ((e^t-1)/t)^(-a) (1) f(t) = e^t-1 (2) which have generating function ...

Let a>|b|, and write h(theta)=(acostheta+b)/(2sintheta). (1) Then define P_n(x;a,b) by the generating function f(x,w)=f(costheta,w)=sum_(n=0)^inftyP_n(x;a,b)w^n ...

Polynomials S_k(x) which form the Sheffer sequence for g(t) = e^(-t) (1) f^(-1)(t) = ln(1/(1-e^(-t))), (2) where f^(-1)(t) is the inverse function of f(t), and have ...

The polynomials G_n(x;a,b) given by the associated Sheffer sequence with f(t)=e^(at)(e^(bt)-1), (1) where b!=0. The inverse function (and therefore generating function) ...

Polynomials s_k(x;lambda) which form a Sheffer sequence with g(t) = 1+e^(lambdat) (1) f(t) = e^t-1 (2) and have generating function ...

The polynomials a_n^((beta))(x) given by the Sheffer sequence with g(t) = (1-t)^(-beta) (1) f(t) = ln(1-t), (2) giving generating function ...