Consider f(n):= the number of ways of walking from the origin to the point,

    [53, 141],  in the THREE-QUARTER-PLANE, with 3*n-2 steps using the Kreweras steps {\
    [-1,0],[0,-1],[1,1]}

Then f(n)=0 for n<, FAIL[2], and defining, g(n) = f(FAIL[2] - 1 + n),

    g(n)  is annihilated by an operator of order, 0,

    and degree in n of the  coefficients, 0



                                   Here it is



FAIL[1]


                           --------------------------

                        This took, 606806.213, seconds.