Algorithm B2 Computation of coefficients $b_n$

Require: coefficients $a_1,a_2,a_3,a_4$, integer N

Define an array $q=[0,0,0,0]$

Define an array b of size N

$b\left(0\right)=1$

Compute p with Algorithm B1

for $n=1:N$ do

$tmp=0$

for $k=1:4$ do

$tmp=tmp-a_{k}q(k-1)$

end for

$b\left(n\right)=b\left(n\right)+tmp$

for $k=n/9:(n-1)$ do

$b\left(n\right)=b\left(n\right)-b\left(k\right)p(n-k,2k)$

end for

$q(1:3)=q(0:2)$ and $q\left(0\right)=tmp$

end for

return b