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 A054595 #10 Nov 25 2020 09:07:32 %S A054595 1,3,22,255,3321,52948,1064988,25071525,667694395,20114706546, %T A054595 678833013618,25302305856919,1033146095157645,45956558123679960, %U A054595 2213869047416018296,114892917344393371209,6396625360877830999983 %N A054595 Number of labeled 2-connected minimally 2-edge-connected graphs by nodes. %C A054595 The reference given here also contains the edge breakups for each node given here. %H A054595 S. K. Pootheri, <a href="https://athenaeum.libs.uga.edu/handle/10724/20082">Counting classes of labeled 2-connected graphs</a>, M.S. Dissertation, University of Georgia, 2000. %H A054595 S. K. Pootheri, <a href="/A054595/a054595.pdf">Counting classes of labeled 2-connected graphs</a>, M.S. Thesis, University of Georgia, 2000. [Local copy] %H A054595 S. K. Pootheri, <a href="https://athenaeum.libs.uga.edu/handle/10724/20083">Characterizing and counting classes of unlabeled 2-connected graphs</a>, Ph. D. Dissertation, University of Georgia, 2000. %H A054595 S. K. Pootheri, <a href="/A003317/a003317_1.pdf">Characterizing and counting classes of unlabeled 2-connected graphs</a>, Ph. D. Dissertation, University of Georgia, 2000. [Local copy] %Y A054595 Cf. A054317, A001072, A054596. %K A054595 nice,nonn %O A054595 3,2 %A A054595 Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000