login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A262322 The number of 4-connected triangulations of the triangle with n inner vertices. 0
1, 0, 0, 1, 1, 3, 13, 47, 217, 1041, 5288, 27844, 150608, 831229 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,6
COMMENTS
Also the number of 4-connected simplicial polyhedra with n nodes with one marked face.
Values obtained by generating 4-connected simplicial polyhedra with plantri, marking each face in the polyhedron, and then sorting out isomorphic ones.
LINKS
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]
CROSSREFS
Sequence in context: A084519 A304628 A265920 * A180278 A193164 A122424
KEYWORD
nonn,more
AUTHOR
Moritz Firsching, Sep 18 2015
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 27 19:01 EST 2024. Contains 370378 sequences. (Running on oeis4.)