172286
domain: N
Appears in sequences
- Array T(n,k), n,k nonnegative: the total number of checks required by a "double-support" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero.at n=47A058347
- Numbers k such that A065608(k) = A065608(k+1).at n=14A065062
- 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, 0, 0), (0, -1, 1), (1, -1, 0), (1, 1, -1), (1, 1, 0)}.at n=10A149351