A007025 - OEIS

%I M3487 #30 Dec 26 2021 21:38:09

%S 0,0,1,1,4,14,67,428,3515,31763,307543,3064701,31199068,322264655,

%T 3369911732,35611596455,379881408164,4086847012014,44308209298480

%N Number of polyhedral graphs with n nodes and minimal degree 4.

%D M. B. Dillencourt, Polyhedra of small orders and their Hamiltonian properties. Tech. Rep. 92-91, Info. and Comp. Sci. Dept., Univ. Calif. Irvine, 1992.

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

%H Gunnar Brinkmann and Brendan McKay, <a href="http://users.cecs.anu.edu.au/~bdm/plantri/plantri-guide.txt">Guide to using plantri</a>

%H CombOS - Combinatorial Object Server, <a href="http://combos.org/plantri">generate planar graphs</a>

%H M. B. Dillencourt, <a href="http://dx.doi.org/10.1006/jctb.1996.0008">Polyhedra of small orders and their Hamiltonian properties</a>, Journal of Combinatorial Theory, Series B, Volume 66, Issue 1, January 1996, Pages 87-122.

%K nonn,more,hard

%O 4,5

%A _N. J. A. Sloane_

%E a(16)-a(20) computed with plantri by _Sean A. Irvine_, Sep 19 2017

%E a(21)-a(22) computed with plantri by _Jan Goedgebeur_, Dec 03 2021