12700801

Appears in sequences

• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=47A174690
• Triangle T(n, k) = n!*binomial(n, k) - n! + 1, read by rows.at n=52A174690
• Triangle T(n, k) = n!*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - n! + 1, read by rows.at n=37A174694
• Triangle T(n, k) = n!*(1/k)*binomial(n-1, k-1)*binomial(n, k-1) - n! + 1, read by rows.at n=43A174694
• Circuit rank of the n-Bruhat graph.at n=9A317483
• Triangle read by rows: T(n, k) = Sum_{i=0..k-2} (-1)^(i+2) * (k-i-1)^n * binomial(k,i).at n=43A366159