#-
#define SIZE "7"
#define SUBNUM "1"
#include meltran.h
.global
*
*   In this program we use a different algorithm to evaluate integrals
*   For Mellin transforms this algorithm is not so useful.
*   The algorithm is explained in the procedure which resides in the 
*   file meltran.h. It is considerably faster than the other algorithm
*   when used for integrals
*
*L  F = sum1(j1,0,inf)*Mel*pow(x,j1)*xsum*den(j1+1)*sign(j1)*
*                   logs(2,x,2)*logs(1,x,1);
*L   F = Mel*sum1(j1,0,inf)*pow(x,j1)*sign(j1)*xsum*Li(4,6,x,1);
L   F = Mel*Li(4,6,x,1)*Li(3,4,x,1);
*L  F = logs(1,x,2)*(logs(2,x,1)*den(1-x)*logs(3,x,1)
*           -logs(2,x,2)*den(1+x)/2)*Mel;
Multiply xsum;
#call melsum2
Print +f +s;
.end