Number of non-isomorphic planar graphs with n edges that are exactly 2-vertex connected and 3-edge-connected.

A392848

Number of non-isomorphic planar graphs with n edges that are exactly 2-vertex connected and 3-edge-connected.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =7a(4) =21a(5) =60a(6) =202a(7) =655a(8) =2279a(9) =7862a(10) =27826a(11) =98754a(12) =354296a(13) =1275887a(14) =4622791a(15) =16810867a(16) =61393493a(17) =224967840a(18) =827189275a(19) =3050816761a(20) =11285310183a(21) =41860892843a(22) =155685925555a(23) =580461454659

External references