|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|