Recursive-Algorith To Transform Sequences

[Leroy Quet]

>Leroy Quet <qq-quet at mindspring.com> wrote:
>
>> Let a(0,k) be the starting integer sequence.
>> (First term is a(0,1).)
>> 
>> Let, for m =  positive integer,
>> 
>> a(m,k) = a(k,m-1) + a(m-1,k-a(m-1,m)) for k > a(m-1,m);
>> a(m,k) = a(k,m-1) for k <= a(m-1,m).
>> 
>I'm guessing you mean:
>
>a(m,k) = a(m-1,k) + a(m-1,k-a(m-1,m)) for k > a(m-1,m);
>a(m,k) = a(m-1,k) for k <= a(m-1,m).
>
>Christian

Ugg...
Yes, sorry.

thanks,
Leroy Quet