This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A361578 #16 Jul 23 2025 16:04:20 %S A361578 1,0,1,1,5,8,30,85,382,1550,7352 %N A361578 Number of 5-connected polyhedra (or 5-connected simple planar graphs) with n nodes. %C A361578 The icosahedral graph is the smallest 5-connected planar graph. %D A361578 M. Kirchweger, M. Scheucher, and S. Szeider, SAT-Based Generation of Planar Graphs, in preparation. %H A361578 <a href="https://math.stackexchange.com/questions/929971/what-is-the-smallest-5-vertex-connected-5-edge-connected-planar-graph">Mathematics Stack Exchange -- What is the smallest 5-vertex-connected (5-edge-connected) planar graph?</a> %Y A361578 Cf. A086216, A005470, A003094, A021103, A000944, A007027. %Y A361578 Cf. A049373 (planar graphs with minimum degree~5) and A111358 (5-connected planar trianguations) %K A361578 nonn,hard,more %O A361578 12,5 %A A361578 _Manfred Scheucher_, Mar 16 2023