EXAMPLE (9)
===========

Let beta[0]=1 and beta[n]=0 for n>0.
Find sequence alpha[n] such that  (alpha[n],beta[n]) is a Bailey pair.

==============================================================================
> read "FUNCS.txt":
> beta:=proc(a,q,n)
>    if n=0 then
>       RETURN(1):
>    else
>       RETURN(0):
>    fi:
> end:
> 
>  for j from 0 to 10 do
>     print(j,expand(normal(beta2alpha(beta,1,q,j))));
>  od;
                                      0, 1

                                   1, -q - 1

                                       3
                                   2, q  + q

                                       6    3
                                  3, -q  - q

                                      10    6
                                  4, q   + q

                                      15    10
                                 5, -q   - q

                                      21    15
                                  6, q   + q

                                      28    21
                                 7, -q   - q

                                      36    28
                                  8, q   + q

                                      45    36
                                 9, -q   - q

                                      55    45
                                 10, q   + q

==============================================================================