On the number of rooted c-nets (Q793049)

The number \(c_ n\) of rooted 3-connected maps with n edges was first found in [\textit{W. T. Tutte}, Can. J. Math. 15, 249-271 (1963; Zbl 0115.173)]; the generating function for \(c_ n-2(-1)^ n\) was found in parametric form and then Lagrange's expansion formula was used to find a linear first-order recursion from which these numbers can be computed. Starting from that parametric form, the article under review derives the generating function explicitly and uses it to obtain two other linear recursions, one with constant coefficients, and a closed-form formula for \(c_ n\) as the sum of about n/2 terms, all but at most one of which are positive. Reviewer's remark: There are a number of confusing misprints in the article. For example, Y and x are reversed in equation (6), the second \('='\) in equation (10) should be \('+'\), and the \((x-x)^ 3\) in the line above equation (12) should be \((2-x)^ 3\). Also, a simpler sum of n/2 positive terms can be found directly from the integral \(J_ n=\int^{1}_{0}t^ n(2t-1)^ ndt\) of W. T. Tutte [ibid.]: make the change of variables \(u=2t-1\), expand the resulting integrand, integrate term by term and then substitute into (8.14) and (8.16) of W. T. Tutte [ibid.].