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 A006867 M1527 #11 Feb 28 2024 09:39:18 %S A006867 1,2,5,20,107,826,7703,81231,914973,10772406 %N A006867 Number of irreducible polyhedral graphs with n faces. %C A006867 A polyhedral graph is irreducible if it ceases to be 3-connected upon removal of any edge. - _Andrey Zabolotskiy_, Feb 28 2024 %D A006867 M. B. Dillencourt, personal communication. %D A006867 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A006867 M. B. Dillencourt, <a href="https://doi.org/10.1006/jctb.1996.0008">Polyhedra of small orders and their Hamiltonian properties</a>, J. Comb. Theory, Ser. B, 66 (1996) 87-122. %Y A006867 Cf. A006866, A000944. %K A006867 nonn,more %O A006867 4,2 %A A006867 _N. J. A. Sloane_ %E A006867 a(13) from Dillencourt (1996) added by _Andrey Zabolotskiy_, Feb 28 2024