3902344domain: NAppears in sequencesNumber of simple unlabeled n-node graphs of connectivity 3.at n=9A052444Number of overcubic partitions of n.at n=33A246584Zeroth trisection of A246584.at n=11A246585Triangle read by rows: T(n,k) = number of unlabeled graphs with n nodes and connectivity exactly k (n>=1, 0<=k<=n-1).at n=48A259862