References to A123545

Triangle read by rows: T(n,k) = number of unlabeled connected graphs on n nodes with degree >= 3 at each node (n >= 1, 0 <= k <= n(n-1)/2).
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0

1 seqfan posts