36659

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), (0, 1, 0), (1, -1, 1)}.at n=11A148260
• Number of increasing sequences of n integers x(1),...,x(n) with values in 1..4*n such that x(j) divides x(k) iff j divides k.at n=40A180381
• Number of (4*n)X4 binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row.at n=5A188411
• T(n,k)=Number of (n*k)Xk binary arrays with rows in nonincreasing order, n ones in every column and no more than 3 ones in any row.at n=41A188416
• Number of (6*n)Xn binary arrays with rows in nonincreasing order, 6 ones in every column and no more than 3 ones in any row.at n=3A188421
• Numbers n such that 9n is a partition number.at n=7A222179