66092

Appears in sequences

• Number of n X 3 0..1 arrays with every element unequal to 0, 1, 2, 3, 6 or 8 king-move adjacent elements, with upper left element zero.at n=9A316284
• Irregular triangular array read by rows. Let S_n be the set of labeled graphs G on [n] with 2-colored nodes where black nodes are only connected to white nodes and vice versa. Orient the edges in each such graph G from black to white. T(n,k) is the number of graphs in S_n containing exactly k descents, n>=0, 0<=k<=A002620(n).at n=32A381058