|
Search: id:A123235
|
|
|
| A123235 |
|
Strange recursive polynomial triangular array related to the Bessel function has two levels for each power of the polynomial variable: p(k, x) = 2*(k - 1)*p(k - 1, x) -x*p(k - 2, x). |
|
+0
2
|
|
| 1, 1, 1, 2, 1, 8, 3, -1, 48, 16, -7, 384, 120, -59, 1, 3840, 1152, -606, 17, 46080, 13440, -7392, 263, -1, 645120, 184320, -104640, 4288, -31, 10321920, 2903040, -1687680, 76000, -759, 1, 185794560, 51609600, -30562560, 1472640, -17950, 49
(list; table; graph; listen)
|
|
|
OFFSET
|
1,4
|
|
|
COMMENT
|
The Bessel recursive polynomial from Jahnke and Emde is: Z(p-1,x)+Z(p+1,x)=(2*p/x)*Z(p,x) Rearranging gives: x*Z(p+1,x)=2*p*Z(p,x)-x*Z(p-1,x) Replace p with k-1: x*Z(k,x)=2*(k-1)*Z(k-1,x)-x*Z(k-2,x) By doing it in two levels it appears that a Bessel polynomial results. Triangle row sums give A093856
|
|
REFERENCES
|
Eugene Jahnke and Fritz Emde, Table of Functions with Formulae and Curves, Dover Book, New York,1945, page 144
|
|
FORMULA
|
p(k, x) = 2*(k - 1)*p(k - 1, x) - x*p(k - 2, x)
|
|
EXAMPLE
|
{1},
{1, 1},
{2, 1},
{8, 3, -1},
{48, 16, -7},
{384, 120, -59, 1},
{3840, 1152, -606, 17},
{46080, 13440, -7392, 263, -1}
|
|
MATHEMATICA
|
p[0, x] = 1; p[1, x] = x + 1; p[k_, x_] := p[k, x] = 2*(k - 1)*p[k - 1, x] - x*p[k - 2, x]; w = Table[CoefficientList[p[n, x], x], {n, 0, 10}]; Floor[w]
|
|
CROSSREFS
|
Cf. A093856.
Sequence in context: A011208 A001281 A065826 this_sequence A140273 A021462 A082834
Adjacent sequences: A123232 A123233 A123234 this_sequence A123236 A123237 A123238
|
|
KEYWORD
|
uned,tabl,sign
|
|
AUTHOR
|
Roger Bagula (rlbagulatftn(AT)yahoo.com), Oct 06 2006
|
|
|
Search completed in 0.002 seconds
|
