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!)
A007027 Number of 4-connected polyhedral graphs with n nodes.
(Formerly M3402)
3

%I M3402 #15 Feb 27 2024 21:03:51

%S 1,0,1,1,4,10,53,292,2224,18493,167504,1571020,15151289,148864939,

%T 1485904672,15028654628,153781899708,1589921572902,16591187039082

%N Number of 4-connected polyhedral graphs with n nodes.

%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 Jan Goedgebeur, Kenta Noguchi, Jarne Renders, and Carol T. Zamfirescu, <a href="https://arxiv.org/abs/2401.04554">HIST-Critical Graphs and Malkevitch's Conjecture</a>, arXiv:2401.04554 [math.CO], 2024. See p. 9 and table 4.

%K nonn,hard

%O 4,5

%A _N. J. A. Sloane_

%E a(16)-a(17) from _Sean A. Irvine_, Sep 19 2017

%E a(18)-a(22) from Goedgebeur et al. added by _Andrey Zabolotskiy_, Feb 27 2024

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 April 23 14:49 EDT 2024. Contains 371914 sequences. (Running on oeis4.)