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 A007102 M5251 #16 Oct 13 2017 05:29:14 %S A007102 1,0,0,0,35,14700,11832975,15245900670,29683109280825, %T A007102 84114515340655800,335974271076054435825,1839316574841276904122750, %U A007102 13461678841737111645720135075,128798406388658994689642297857500 %N A007102 Number of labeled disconnected trivalent (or cubic) graphs with 2n nodes. %D A007102 R. W. Robinson, personal communication. %D A007102 R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976. %D A007102 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A007102 R. W. Robinson, <a href="/A007102/b007102.txt">Table of n, a(n) for n = 0..30</a> %F A007102 a(n) = A002829(n) - A004109(n), for n>0. - _Sean A. Irvine_, Oct 12 2017 %K A007102 nonn %O A007102 0,5 %A A007102 _N. J. A. Sloane_