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 A006607 M3711 #16 Jul 08 2025 16:50:27 %S A006607 0,4,120,33600,18446400,18361728000,30199104936000,76326119565696000, %T A006607 280889824362219072000,1443428429045578335360000, %U A006607 10016498030869925136622080000,91330153089556497015273454080000 %N A006607 Number of labeled connected rooted trivalent graphs with 2n nodes. %D A006607 R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1977. %D A006607 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A006607 N. C. Wormald, Triangles in labeled cubic graphs, pp. 337-345 of Combinatorial Mathematics (Canberra, 1977), Lect. Notes Math. 686, 1978. %H A006607 R. W. Robinson, <a href="/A006607/b006607.txt">Table of n, a(n) for n = 1..29</a> %Y A006607 Cf. A002829, A286757 (corrected version?) %K A006607 nonn %O A006607 1,2 %A A006607 _N. J. A. Sloane_