61224

Appears in sequences

• A recursion triangle sequence based on the Eulerian numbers: A(n,k)=n*A(n-1,k-1)+k*Eulerian(n-1,k).at n=32A157743
• Number of length n+2 0..2 arrays with at most one downstep in every n consecutive neighbor pairs.at n=18A255109
• Sum over all partitions of n of the GCD of the number of parts and the number of distinct parts.at n=39A339312