“…Natural first attempts would be induction and Gosper's algorithm, and neither of these is successful, as for one thing, the summands depend not only on the summing index i but also on n. The challenge remains to establish a closed-form expression for N q (m, n; ∞; ∞) and N q (m, n; ∞; q − 1) for higher m. Today, his homomorphism τ is called the first Johnson homomorphism and has been generalized to those of higher degrees. Over the last two decades, good progress was made in the study of the Johnson homomorphisms of mapping class groups through the work of many authors including Morita [1993a], Hain [1997] and others. Let F n be a free group generated by x 1 , x 2 , .…”