(HP49/50) Laguerre Polynomials

[John Keith]

A new version of the above program which is shorter and faster, but requires the ListExt and GoferLists libraries. The command COXF is the ConvOffs transform, the first program here.

Code:


\<< \-> n x
  \<< n LSEQ DUP COXF DUP * SWAP 1 :: * Scanl 1 n I\->R 2. MOD
{ NEG } IFT -1 n 1 + LMSEQ * * DUP Last SWAP AXL x PEVAL SWAP /
  \>>
\>>