136764

Appears in sequences

• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (-1, -1, 0), (0, 1, 1), (1, 0, 1), (1, 1, -1)}.at n=9A150273
• Triangle: m=3; e(n,k,n) = (k + m - 1)*e(n - 1, k, m) + (m*n - k + 1 - m)*e(n - 1, k - 1, m); t(n,k) = e(n,k,m) + e(n,n-k,m).at n=29A156186
• Triangle: m=3; e(n,k,n) = (k + m - 1)*e(n - 1, k, m) + (m*n - k + 1 - m)*e(n - 1, k - 1, m); t(n,k) = e(n,k,m) + e(n,n-k,m).at n=34A156186
• Number of -n..n arrays x(0..3) of 4 elements with zero sum and no two consecutive zero elements.at n=28A199531
• Number of length 3+2 0..n arrays with the sum of the maximum minus the minimum of adjacent triples multiplied by some arrangement of +-1 equal to zero.at n=16A252179