417199

Appears in sequences

• Sum of Gaussian binomial coefficients [n,k] for q=2 and k=0..n.at n=8A006116
• Triangle read by rows: T(n,k) is the number of chains of length k in the partially ordered (by subspace inclusion) set of all subspaces of GF(2)^n, n>=0, 0<=k<=n.at n=36A293845
• Triangle read by rows: T(n,k) is the number of ways to choose a k-dimensional subspace U of an n-dimensional vector space over GF(2) and then choose a subspace of U.at n=36A302595
• Square array read by descending antidiagonals: T(n,k) is the number of subgroups of the elementary abelian group of order A000040(k)^n for n >= 0 and k >= 1.at n=44A370887
• 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=42A381058
• Rectangular array read by antidiagonals: T(n,k) is the number of labeled digraphs on [n] along with a (coloring) function c:[n] -> [k] with the property that for all u,v in [n], u->v implies u<v and c(u)<c(v), n>=0, k>=0.at n=57A382223