1575656250domain: NAppears in sequencesNumber of spanning trees in the n-crown graph.at n=4A193133Triangle read by rows: number of spanning trees obtained for an almost-complete bipartite graph by removing k disjoint edges from the complete bipartite graph K n,n with k<=n.at n=27A260383