32676

Appears in sequences

• A higher order recursion triangle sequence: m=4;l=4;e(n,k,m)=(l*k + m - 1)e(n - 1, k, m) + (m*n - l*k + 1 - m)e(n - 1, k - 1, m).at n=22A156280
• G.f.: exp( Sum_{n>=1} A174466(n)*x^n/n ) where A174466(n) = Sum_{d|n} d*sigma(n/d)*tau(d).at n=17A174465
• Number of nX2 0..3 arrays with adjacent row and column sums unequal.at n=3A202632
• Number of nX4 0..3 arrays with adjacent row and column sums unequal.at n=1A202634
• T(n,k)=Number of nXk 0..3 arrays with adjacent row and column sums unequal.at n=11A202636
• T(n,k)=Number of nXk 0..3 arrays with adjacent row and column sums unequal.at n=13A202636