79745

Appears in sequences

• Number of labeled spanning trees in the complete hypergraph on n vertices (all hyperedges having cardinality 2 or greater).at n=7A030019
• a(n) = (n!)^n * Sum_{k=0..n} 1 / ((k!)^n * (n-k)!).at n=4A336249
• a(n) is the integer w such that (c(n)^2, -d(n)^2, w) is a primitive solution to the Diophantine equation 2*x^3 + 2*y^3 + z^3 = 11^3, where c(n) = F(n+2) + (-1)^n * F(n-3), d(n) = F(n+3) + (-1)^n * F(n-2) and F(n) is the n-th Fibonacci number (A000045).at n=9A356717