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 A338511 #20 Dec 12 2020 06:31:52 %S A338511 1,0,1,3,4,7,22,51,152,501,1739,6548,26260,110292,483545,2198726, %T A338511 10327116,49965520,248481062,1267987437,6630660484,35492360163, %U A338511 194283212876 %N A338511 Number of unlabeled 3-connected graphs with n edges. %C A338511 The smallest 3-connected graph is the complete graph on 4 vertices which has 6 edges. %H A338511 Hugo Pfoertner, <a href="http://www.randomwalk.de/sequences/a337517_3cc.zip">3-connected graphs for n<=18 edges</a>, list in PARI-readable format. %H A338511 R. W. Robinson, <a href="http://web.archive.org/web/20041220072855/http://www.cs.uga.edu/~rwr/publications/tables.pdf">Tables of 2-Connected and 3-Connected Graphs by Nodes and Edges</a>, Table VI, pages 19-27. %o A338511 (PARI) \\ It is assumed that the 3cc.gp file (from the linked zip archive) has been read before, i.e., \r [path]3cc.gp %o A338511 for(k=1,#ThreeConnectedData,print1(#ThreeConnectedData[k],", ")); %o A338511 \\ printing of the graphs for n <= 9 %o A338511 print(ThreeConnectedData[6..9]) \\ _Hugo Pfoertner_, Dec 11 2020 %Y A338511 Column sums of A339072. %Y A338511 Cf. A002880, A006290, A010355, A338414. %K A338511 nonn,more %O A338511 6,4 %A A338511 _Andrew Howroyd_, Oct 31 2020 %E A338511 a(17)-a(25) from _Hugo Pfoertner_ using data from Robinson's tables, Nov 20 2020 %E A338511 a(26)-a(28) from _Andrew Howroyd_ using data from Robinson's tables, Nov 24 2020