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 A007027 M3402 #15 Feb 27 2024 21:03:51 %S A007027 1,0,1,1,4,10,53,292,2224,18493,167504,1571020,15151289,148864939, %T A007027 1485904672,15028654628,153781899708,1589921572902,16591187039082 %N A007027 Number of 4-connected polyhedral graphs with n nodes. %D A007027 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 A007027 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A007027 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 A007027 nonn,hard %O A007027 4,5 %A A007027 _N. J. A. Sloane_ %E A007027 a(16)-a(17) from _Sean A. Irvine_, Sep 19 2017 %E A007027 a(18)-a(22) from Goedgebeur et al. added by _Andrey Zabolotskiy_, Feb 27 2024