login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A298399
Triangle read by rows: T(n,k) is the number of direct sum decompositions of GF(2)^n whose maximal subspace has dimension k, 1<=k<=n, n>=1.
0
1, 3, 1, 28, 28, 1, 840, 1960, 120, 1, 83328, 416640, 39680, 496, 1, 27998208, 295536640, 40354560, 666624, 2016, 1, 32509919232, 733279289344, 138360668160, 2757537792, 10924032, 8128, 1, 132640470466560, 6568159593103360, 1654847774392320, 38430207737856, 181463777280, 176865280, 32640, 1
OFFSET
1,2
LINKS
Geoffrey Critzer, Combinatorics of Vector Spaces over Finite Fields, Master's thesis, Emporia State University, 2018.
David Ellerman, The number of direct-sum decompositions of a finite vector space, arXiv:1603.07619 [math.CO], 2016.
EXAMPLE
Triangle begins:
1;
3, 1;
28, 28, 1;
840, 1960, 120, 1;
83328, 416640, 39680, 496, 1;
...
MATHEMATICA
nn = 7; \[Gamma][n_] := (q - 1)^n q^Binomial[n, 2] FunctionExpand[ QFactorial[n, q]] /. q -> 2; Grid[Map[Select[#, # > 0 &] &,
Drop[Transpose[Table[Table[\[Gamma][n], {n, 0, nn}] CoefficientList[Series[Exp[Sum[z^i/\[Gamma][i], {i, 1, k + 1}]] -
Exp[Sum[z^i/\[Gamma][i], {i, 1, k}]], {z, 0, nn}], z], {k, 0, 4}]], 1]]]
CROSSREFS
Cf. A053601 (column 1), A270881 (row sums), A298561.
Sequence in context: A288517 A188110 A358165 * A365087 A120066 A326797
KEYWORD
nonn,tabl
AUTHOR
Geoffrey Critzer, Jan 18 2018
STATUS
approved