

A002880


Number of 3connected nets with n edges.
(Formerly M0381 N0143)


7



1, 0, 1, 1, 2, 2, 9, 11, 37, 79, 249, 671, 2182, 6692, 22131, 72405, 243806, 822788, 2815119, 9679205, 33551192, 116900081, 409675567, 1442454215, 5102542680, 18124571838, 64634480340, 231334873091, 830828150081, 2993489821771
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

6,5


COMMENTS

Also, the number of 3connected quadrangulations without separating 4cycles (up to orientation) with n faces.  Andrey Zabolotskiy, Sep 20 2019


REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


LINKS

J. A. D. Cameron, Searching for Squared Squares, USYD Master of Science Thesis (1976). Rare Books & Special Collections Fisher Library, Sydney University.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph.
Gunnar Brinkmann and Brendan McKay, plantri and fullgen programs for generation of certain types of planar graph [Cached copy, pdf file only, no active links, with permission]


EXAMPLE

G.f. = x^6 + x^8 + x^9 + 2*x^10 + 2*x^11 + 9*x^12 + 11*x^13 + 37*x^14 + ...


CROSSREFS



KEYWORD

nonn,nice


AUTHOR



STATUS

approved



