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 A005644 M5190 #20 Jul 08 2025 16:33:06 %S A005644 1,26,1768,225096,51725352,21132802544,15463799747936, %T A005644 20604021770403328,50928019401158515328,237644423948928994197504, %U A005644 2125373296900166452199861760,36884133903194627014531723872256 %N A005644 Number of labeled 3-connected graphs with n nodes. %D A005644 Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, p. 403. %D A005644 R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1976. %D A005644 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A005644 R. W. Robinson, <a href="/A005644/b005644.txt">Table of n, a(n) for n = 4..25</a> %H A005644 T. R. S. Walsh, <a href="https://doi.org/10.1016/0095-8956(82)90072-7">Counting labeled three-connected and homeomorphically irreducible two-connected graphs</a>, J. Combin. Theory Ser. B 32 (1982), no. 1, 1-11. %Y A005644 Row sums of A123542. %K A005644 nonn %O A005644 4,2 %A A005644 _N. J. A. Sloane_ %E A005644 Corrected and extended by _N. J. A. Sloane_, Nov 13 2006