112681

Appears in sequences

• Number of permutations of 2 copies of 1..n avoiding adjacent step pattern up, up, up, up.at n=5A177564
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} (-1)^(n-j) * multinomial(n+(k-1)*j; n-j, {j}^k).at n=30A336169
• a(n) = Sum_{k=0..n} (-1)^(n-k) * (n+4*k)!/((n-k)! * k!^5).at n=2A336171