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 A007101 M4761 #15 Jul 08 2025 16:59:49 %S A007101 1,10,3360,1753920,1812888000,3158396841600,8496995611104000, %T A007101 33199738565849856000,180116271096528678912000, %U A007101 1310903590075375049994240000,12454930569778045924343408640000 %N A007101 Number of labeled trivalent (or cubic) cyclically 4-connected graphs with 2n nodes. %D A007101 R. W. Robinson, personal communication. %D A007101 R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976. %D A007101 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A007101 R. W. Robinson, <a href="/A007101/b007101.txt">Table of n, a(n) for n = 2..30</a> %H A007101 N. C. Wormald, <a href="http://dx.doi.org/10.1002/jgt.3190090418">Enumeration of cyclically 4-connected cubic graphs</a>, J. Number Theory 9 (4) (1985) 563, Theorem 4.1. %K A007101 nonn %O A007101 2,2 %A A007101 _N. J. A. Sloane_