2941225000

Appears in sequences

• Triangle 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=25A260383