19998720
domain: N
Appears in sequences
- Triangle read by rows: T(n,k) is the number of direct sum decompositions of a finite vector space of n dimensions over GF(2) that have exactly k subspaces of dimension 1, n>=0, 0<=k<=n.at n=24A287206
- Irregular triangular array read by rows. T(n,k) is the number of direct sum decompositions V_1 + V_2 + ... + V_m = GF(2)^n with the dimensions of the V_i corresponding to the k-th partition of n in canonical ordering, n >= 0, 1 <= k <= A000041(n).at n=24A358165
- Irregular triangular array read by rows. T(n,k) is the number of direct sum decompositions V_1 + V_2 + ... + V_m = GF(2)^n with the dimensions of the V_i corresponding to the k-th partition of n in canonical ordering, n >= 0, 1 <= k <= A000041(n).at n=25A358165
- Number of strongly magic quad squares that can be formed using cards from Quads-2^n deck.at n=1A362874