``
       The Recurrence operator annihilating a_r(n):=The number of ordered

 partitions (L_1, ..., L_r) where each L_i is an integer partition and the s\
    um of

             all the parts is n, using as parts only {1,2,3,4}: is

                                                 2        3                  4
-n - 10 r + (-11 r - n - 1) N + (-14 r - n - 2) N  - 8 r N  + (n + 4 - 4 r) N

                     5            6
     + (-r + n + 5) N  + (6 + n) N

                           This took, 0.296, seconds