2379348
domain: N
Appears in sequences
- Number of ways to choose a subspace U of GF(2)^n and then choose a subspace of U.at n=7A289539
- 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=58A382223