122580

Appears in sequences

• Triangle T(n,k) of the number of strongly connected digraphs on n labeled nodes and with k arcs, k=0..n*(n-1).at n=35A057273
• Number of unlabeled simple graphs with n nodes of 2 colors whose components are path graphs.at n=13A217194
• a(n) = A257673(2n,n).at n=6A257675
• Column k=6 of triangle A257673.at n=6A321951
• First elements of maximal isospectral chains of length 3.at n=17A335082