96090

Appears in sequences

• Solution to the Dancing School Problem with 4 girls and n+4 boys: f(4,n).at n=18A079909
• Triangle read by rows: T(n,k) = number of permutations p of [n] such that max(|p(i)-i|)=k (n>=1, 0<=k<=n-1).at n=42A130152
• a(n) = 100*n^2 - 10.at n=30A158490
• Number of permutations p of [n] such that max_{j=1..n} |p(j)-j| = 6.at n=3A323802