This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A078672 Number of simple 4-regular 4-edge-connected but not 3-connected plane graphs on n nodes. 2
 0, 0, 0, 0, 0, 0, 1, 1, 6, 16, 59, 188, 685, 2412, 8825, 32110, 118505 (list; graph; refs; listen; history; text; internal format)
 OFFSET 6,9 LINKS A. Caudron, Classification des noeuds et des enlacements Public. Math. d'Orsay 82. Orsay: Univ. Paris Sud, Dept. Math., 1982. S. V. Jablan, Ordering Knots S. V. Jablan, L. M. Radović, and R. Sazdanović, Basic polyhedra in knot theory Kragujevac J. Math., 28 (2005), 155-164. EXAMPLE The first such graph has 12 nodes. It is called 12E [Jablan, Radović & Sazdanović, Fig. 2; or Caudron, p. 308c] and looks like that:     ___________    /           \   / O---O   O---O   |/|\ /|\ /|\ /|   O | O | O | O |   |\|/ \|/ \|/ \|   \ O---O   O---O    \___________/ CROSSREFS A078666 = A007022 + this sequence. Sequence in context: A223028 A091649 A125628 * A219817 A120795 A118640 Adjacent sequences:  A078669 A078670 A078671 * A078673 A078674 A078675 KEYWORD nonn AUTHOR Slavik V. Jablan (jablans(AT)yahoo.com) and Brendan McKay Feb 06 2003 STATUS approved

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

Last modified January 16 23:44 EST 2019. Contains 319206 sequences. (Running on oeis4.)