%I #4 Sep 03 2019 09:57:44

%S 1,0,1,0,0,1,1,1,1,2,2,1,2,3,7,5,4,1,1

%N Irregular triangle read by rows with trailing zeros removed where T(n,k) is the number of unlabeled simple graphs covering n vertices with non-spanning edge-connectivity k.

%C The non-spanning edge-connectivity of a graph is the minimum number of edges that must be removed to obtain a disconnected or empty graph, ignoring isolated vertices.

%H Gus Wiseman, <a href="/A327201/a327201.png">Unlabeled graphs covering 5 vertices, organized by non-spanning edge-connectivity.</a>

%e Triangle begins:

%e 1

%e {}

%e 0 1

%e 0 0 1 1

%e 1 1 2 2 1

%e 2 3 7 5 4 1 1

%Y Row sums are A002494.

%Y Column k = 0 is A327075.

%Y The labeled version is A327149.

%Y Spanning edge-connectivity is A263296.

%Y The non-covering version is A327236 (partial sums).

%Y Cf. A000088, A322338, A322396, A326787, A327076, A327077, A327079, A327126, A327129, A327148, A327235.

%K nonn,tabf,more

%O 0,10

%A _Gus Wiseman_, Sep 03 2019