113588

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, 0, 1), (0, 0, 1), (0, 1, -1), (1, -1, -1)}.at n=13A148025
• Triangular array, T(n,k) = s(n,k) + s(n,n-k), where s(n,k) are the Stirling numbers of the first kind.at n=48A154843
• Triangular array, T(n,k) = s(n,k) + s(n,n-k), where s(n,k) are the Stirling numbers of the first kind.at n=51A154843
• G.f.: A(x) = Sum_{n>=0} x^(n*(n+1)/2) / Product_{k=1..n} (1-x^k)^(n-k+1).at n=27A206139
• Number of 3Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or zero plus the sum of the elements above it or one plus the sum of the elements diagonally to its northwest or one plus the sum of the elements antidiagonally to its northeast, modulo 4.at n=10A241285