OFFSET
0,4
COMMENTS
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. Note that this means a single node has vertex-connectivity 0.
LINKS
FORMULA
T(n,k) = Sum_{j=k..n} A259862(n,j).
EXAMPLE
Triangle begins:
1
1 0
2 1 0
4 2 1 0
11 6 3 1 0
34 21 10 3 1 0
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Gus Wiseman, Sep 26 2019
EXTENSIONS
Terms a(21) and beyond from Andrew Howroyd, Dec 26 2020
STATUS
approved