universalFGL(n,s,t,u)
The following returns the formal group law over the Lazard ring (seen as a polynomial ring in the {a_i}'s up to degree n.


The decomposition of the Lazard as a polynomial ring in an infinite number of variables is not canonical, we have made a choice, here, which amounts to choosing, for every d at most n, of Bezout coefficients for the set of binomial coefficients (d,i), 1<i<d. Variables with names equal to the strings (like x, y or a, here) should not have been assigned values (like 3) beforehand otherwise an error will occur.