# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a346412
Showing 1-1 of 1

%I A346412 #9 Jul 21 2021 09:29:03
%S A346412 1,1,3,1,21,42,1,105,1470,2520,1,465,32550,390600,624960,1,1953,
%T A346412 605430,36325800,406848960,629959680,1,8001,10417302,2768025960,
%U A346412 155009453760,1680102466560,2560156139520,1,32385,172741590,192779614440,47809344381120,2590958018073600,27636885526118400,41781748196966400
%N A346412 Triangular array read by rows: T(n,k) is the number of nilpotent n X n matrices over GF(2) having rank k, 0 <= k <= n-1, n >= 1.
%H A346412 Kent E. Morrison, <a href="http://www.cs.uwaterloo.ca/journals/JIS/VOL9/Morrison/morrison37.html">Integer Sequences and Matrices Over Finite Fields</a>, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1.
%e A346412 Array begins
%e A346412   1;
%e A346412   1,    3;
%e A346412   1,   21,     42;
%e A346412   1,  105,   1470,     2520;
%e A346412   1,  465,  32550,   390600,    624960;
%e A346412   1, 1953, 605430, 36325800, 406848960, 629959680
%e A346412 T(2,0) = 1 because the zero matrix has rank 0.
%e A346412 T(2,1) = 3 because {{0,0},{1,0}}, {{0,1},{0,0}}, {{1,1},{1,1}} have rank 1.
%t A346412 nn = 10; q = 2; b[p_, i_] := Count[p, i];d[p_, i_] :=Sum[j b[p, j], {j, 1, i}] + i Sum[b[p, j], {j, i + 1, Total[p]}]; aut[deg_, p_] :=  Product[Product[
%t A346412    q^(d[p, i] deg) - q^((d[p, i] - k) deg), {k, 1, b[p, i]}], {i, 1, Total[p]}]; A001037 = Table[1/n Sum[MoebiusMu[n/d] q^d, {d, Divisors[n]}], {n, 1, nn}];
%t A346412 g[u_, v_] := Total[Map[v^(Total[#] - Length[#]) u^Total[#]/aut[1, #] &,
%t A346412    Level[Table[IntegerPartitions[n], {n, 0, nn}], {2}]]];Map[Select[#, # > 0 &] &,Drop[Table[Product[q^n - q^i, {i, 0, n - 1}], {n, 0, nn}] CoefficientList[
%t A346412      Series[g[u, v], {u, 0, nn}], {u, v}], 1]] // Grid
%Y A346412 Cf. A134057 (column k=1), A083402 (main diagonal), A053763 (row sums).
%K A346412 nonn,tabl
%O A346412 1,3
%A A346412 _Geoffrey Critzer_, Jul 15 2021

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE