976560

Appears in sequences

• Triangle T(n,k), n>=0, 0<=k<=n, read by rows: T(n,k) = number of simple graphs on n labeled nodes with k edges where each maximally connected subgraph has at most one cycle.at n=43A144228
• a(n) = (n^5 - n)/10, which is always an integer.at n=24A164938