[seqfan] Re: Tabl formula?

[Alois Heinz]

It can be a recursive formula or a recursive program.

In Maple syntax:

T:= (n,k)-> `if` (k<=n+1, (2*n+3-k) *2^(k-2), (n+1-k) *binomial(k-1, n)
            *add (binomial(n, j-1) /(k-j) *T(n, j) *(-1)^(n-j), j=1..n+1)):

Alois

Am 01.04.2011 18:56, schrieb Ron Hardin:
> I was thinking perhaps use T(n,k) to compute the first n+1 terms of a row, and
> plug them into a lagrange polynomial to get the kth term of the row (or perhaps
> just expand a zero n+1th difference table out to it), and perhaps some symbolic
> package could rearrange the sums into something simpler.
>
> Maybe it can only be a program, and not a formula, though.
>
>   rhhardin at mindspring.com
> rhhardin at att.net (either)