Triangle read by rows: T(n,k) = number of connected cubic graphs on 2n vertices with crossing number k for n >= 2, k >= 0.

A390643

Triangle read by rows: T(n,k) = number of connected cubic graphs on 2n vertices with crossing number k for n >= 2, k >= 0.