36590

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), (-1, 1, -1), (1, 0, 1), (1, 1, -1)}.at n=10A148654
• Number of nX4 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=5A196714
• Number of nX6 0..4 arrays with each element x equal to the number its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=3A196716
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=39A196718
• T(n,k)=Number of nXk 0..4 arrays with each element x equal to the number of its horizontal and vertical neighbors equal to 4,0,2,1,3 for x=0,1,2,3,4.at n=41A196718
• Number of n-celled polyominoes which are of square type.at n=12A259088
• Rectangular array read by antidiagonals. T(n,k) is the number of length k walks from {} to [n] in the digraph representation of the superset/subset relation on P([n]) the powerset of [n], n>=0, k>=0.at n=61A336703