Triangle read by rows: T(n,k) is the number of simple nonseparable (or 2-connected) graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).

A325447

Triangle read by rows: T(n,k) is the number of simple nonseparable (or 2-connected) graphs on n unlabeled nodes with circumference k, (n >= 3, k >= 3).