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 A327365 #10 Dec 26 2020 23:54:05 %S A327365 1,0,0,1,1,0,2,2,1,0,7,6,3,1,0,23,21,10,3,1,0,122,112,56,17,4,1,0,888, %T A327365 853,468,136,25,4,1,0,11302,11117,7123,2388,384,39,5,1,0,262322, %U A327365 261080,194066,80890,14480,1051,59,5,1,0,11730500,11716571,9743542,5114079,1211735,102630,3211,87,6,1,0 %N A327365 Triangle read by rows where T(n,k) is the number of unlabeled simple graphs covering n vertices with vertex-connectivity >= k. %C A327365 A graph is covering if there are no isolated vertices. %C A327365 The vertex-connectivity of a graph is the minimum number of vertices that must be removed (along with any incident edges) to obtain a non-connected graph or singleton. %H A327365 Gus Wiseman, <a href="/A327365/a327365.png">The graphs counted in row n = 4.</a> %e A327365 Triangle begins: %e A327365 1 %e A327365 0 0 %e A327365 1 1 0 %e A327365 2 2 1 0 %e A327365 7 6 3 1 0 %e A327365 23 21 10 3 1 0 %Y A327365 Column k = 0 is A002494. %Y A327365 Column k = 1 is A001349 (connected graphs), if we assume A001349(0) = A001349(1) = 0. %Y A327365 Column k = 2 is A002218 (2-connected graphs), if we assume A002218(2) = 0. %Y A327365 The non-covering version is A327805, from which this sequence differs only in the k = 0 column. %K A327365 nonn,tabl %O A327365 0,7 %A A327365 _Gus Wiseman_, Sep 26 2019 %E A327365 Terms a(21) and beyond from _Andrew Howroyd_, Dec 26 2020