38194

Appears in sequences

• a(n) = T(n,[ n/2 ]), where T is the array defined in A024996.at n=15A026078
• a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 3, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1) with a(1) = a(2) = 1.at n=15A049940
• Lexicographical-support sequence T(n,k), n,k nonnegative: total number of checks required by a "lexicographical" algorithm to find out which rows and columns of each of the n by k zero-one matrices are nonzero.at n=42A058547
• Number of 3-cycles in the n X n black bishop graph.at n=26A289161
• Number of unlabeled loopless multigraphs with n nodes of degree n or less.at n=6A333898