131576domain: NAppears in sequencesTriangle read by rows: T(n,k) = number of connected cubic graphs on 2n vertices with crossing number k for n >= 2, k >= 0.at n=28A390643