%I #16 Jun 04 2012 23:38:32
%S 3,15,126,1395,18678,289926,5090220,99466371,2138575590,50153137650,
%T 1274013771300,34853264146350,1021795130252988,31964591332833900,
%U 1062945070050997656,37447053359058465507,1393372283171378001030
%N Irreducible near matchings over 2n+1 vertices.
%H Takahisa Toda and Ivo Vigan, <a href="http://venus.cs.qc.cuny.edu/~ivigan/SeparatingFamilies.pdf">On Separating Convex Points with Lines</a>
%F a(n) = A000699(n+1)*(2*n+1)*(n+1)/(2*n).
%e a(1) corresponds to the 3-vertex graphs with edge sets {{1,2},{2,3}}, {{1,2},{1,3}} and {{1,3},{2,3}} respectively.
%e a(2) corresponds to the 5-vertex graphs with edge sets {{1,2},{2,4},{3,5}}, {{1,4},{2,3},{2,5}} ...
%o (PARI)
%o A000699(n)={my(A); A=O(x); for(i=1, n, A=x+A*(2*x*A'-A)); polcoeff(A, n)}
%o a(n)=A000699(n+1)*(2*n+1)*(n+1)/(2*n);
%o vector(66,n,a(n))
%o /* _Joerg Arndt_, May 27 2012 */
%Y Cf. A000699, A200142.
%K nonn
%O 1,1
%A _Ivo Vigan_, May 20 2012