36111

Appears in sequences

• a(n) = d(n-1) + d(n-2) + (n-1)[d(n-2) + 2d(n-3) + d(n-4)], where d(n), the derangement numbers, are given in A000166. (Let d(n) = 0 if n < 0.)at n=8A109742
• Number of -4..4 arrays x(0..n-1) of n elements with zero sum and no element more than one greater than the previous.at n=8A199843
• Number of nondecreasing partitions of n^2 into n parts from the intervals [1,n], [2,n+1], ..., [n,2n-1], respectively.at n=9A362967