R<x> := PolynomialRing(Integers());
S := CuspidalSubspace(ModularForms(1,378));
//S := CuspidalSubspace(ModularForms(1,50));
S;
for p in [n : n in [2..30] |IsPrime(n)] do
   printf "Computing char poly of T_%o:\n",p;
   time f := HeckePolynomial(S,p);
   printf "f%o := %o;\n\n", p, f;
end for;
