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 A054596 #9 May 03 2023 09:13:17 %S A054596 1,3,37,435,6996,134428,3094785,82061325,2473950880,83606473566, %T A054596 3132506471139,128918727009163,5784184164416490,281105943314654760, %U A054596 14716271275161095761,825944690635111256697,49490362937885427672552 %N A054596 Number of labeled minimally 2-edge-connected graphs by nodes. %C A054596 The reference given here also contains the edge breakups for each node given here. %H A054596 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 A054596 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 A054596 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 A054596 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 A054596 Cf. A054317, A001072, A054595. %K A054596 nice,nonn %O A054596 3,2 %A A054596 Sridar K. Pootheri (sridar(AT)math.uga.edu), Apr 14 2000