The generalized recurrence formula is
with the initial conditions
F[-p-1]=0; F[-p]=1; F[-p+1]=0; ...F=0; F=1; ... F[p+1]=1;.
Note that, for
F[-1]=1;. I want to find positive and negative values according to
p. For example, If
p=2 then the formula has the form
with initial conditions
F=0; F=1; F=1; (for positive numbers) and
F=0; F[-1]=0; F[-2]=1; (for negative numbers).
I have achieved the calculation of positive numbers but I didn't find numbers for negative
n values. Is there any code for the calculation for this process?