|
Search: id:A001497
|
|
|
| A001497 |
|
Triangle of coefficients of Bessel polynomials (exponents in decreasing order). |
|
+0 33
|
|
| 1, 1, 1, 3, 3, 1, 15, 15, 6, 1, 105, 105, 45, 10, 1, 945, 945, 420, 105, 15, 1, 10395, 10395, 4725, 1260, 210, 21, 1, 135135, 135135, 62370, 17325, 3150, 378, 28, 1, 2027025, 2027025, 945945, 270270, 51975, 6930, 630, 36, 1, 34459425, 34459425
(list; table; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
The (reverse) Bessel polynomials P(n,x):=sum(a(n,m)*x^m,m=0..n), the row polynomials, called Theta_n(x) in the Grosswald reference, solve x*diff(P(n,x),x$2)-2*(x+n)*diff(P(n,x),x)+2*n*P(n,x)) = 0.
With the related Sheffer associated polynomials defined by Carlitz as
B(0,x) = 1
B(1,x) = x
B(2,x) = x + x^2
B(3,x) = 3 x + 3 x^2 + x^3
B(4,x) = 15 x + 15 x^2 + 6 x^3 + x^4
... (see Mathworld reference), then P(n,x) = 2^n * B(n,x/2) are the Sheffer polynomials described in A119274. - Tom Copeland (tcjpn(AT)msn.com), Feb 10 2008
|
|
REFERENCES
|
Frink, O. and H. L. Krall, A new class of orthogonal polynomials, Trans. Amer. Math. Soc. 65,100-115, 1945 [From Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Feb 15 2009]
E Grosswald, Bessel Polynomials, Lecture Notes Math. vol. 698 1978 p. 18.
B. Leclerc, Powers of staircase Schur functions and symmetric analogues of Bessel polynomials, Discrete Math., 153 (1996), 213-227.
J. Riordan, Combinatorial Identities, Wiley, 1968, p. 77.
|
|
LINKS
|
T. D. Noe, Rows n=0..50 of triangle, flattened
W. Lang, On generalizations of Stirling number triangles, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
Eric Weisstein's World of Mathematics, Bessel Polynomial
Index entries for sequences related to Bessel functions or polynomials
|
|
FORMULA
|
a(n, m)=(2*n-m)!/(m!*(n-m)!*2^(n-m)) if n >= m >= 0 else 0 (from Grosswald, p. 7).
a(n, m)= 0, n<m; a(n, -1) := 0; a(0, 0)= 1; a(n, m) = (2*n-m-1)*a(n-1, m) + a(n-1, m-1), n >= m >= 0 (from Grosswald p. 23, (19)).
E.g.f. for m-th column: ((1-sqrt(1-2*x))^m)/(m!*sqrt(1-2*x)).
G.f.: 1/(1-xy-x/(1-xy-2x/(1-xy-3x/(1-xy-4x/(1-.... (continued fraction). [From Paul Barry (pbarry(AT)wit.ie), Jan 29 2009]
|
|
MAPLE
|
f := proc(n) option remember; if n <=1 then (1+x)^n else expand((2*n-1)*x*f(n-1)+f(n-2)); fi; end;
|
|
PROGRAM
|
(PARI) T(k, n) = if(n>k||k<0||n<0, 0, (2*k-n)!/(n!*(k-n)!*2^(k-n))) (from R. Stephan)
(PARI) {T(n, k)=if(k<0|k>n, 0, binomial(n, k)*(2*n-k)!/2^(n-k)/n!)} /* Michael Somos Oct 03 2006 */
|
|
CROSSREFS
|
Reflected version of A001498 which is considered the main entry.
Other versions of this same triangle are given in A144299, A111924 and A100861.
Row sums give A001515. a(n, 0)= A001147(n) (double factorials).
Sequence in context: A039797 A143171 A112292 this_sequence A123244 A105599 A106210
Adjacent sequences: A001494 A001495 A001496 this_sequence A001498 A001499 A001500
|
|
KEYWORD
|
nonn,tabl,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.003 seconds
|