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”).

A267132
Unipotent n X n matrices over GF(2) that are squares of other such matrices.
0
1, 1, 22, 316, 85096, 23105944, 87537588832
OFFSET
1,3
LINKS
Victor S. Miller, Counting Matrices that are Squares, arXiv:1606.09299 [math.GR], 2016.
FORMULA
a(n)/A002884(n) = sum(lambda,1/C(lambda,2)), where the sum is over all partitions lambda whose conjugate has odd parts with multiplicity <=1 (see A006950), and C(lambda,2) = prod(i>=1,prod(k=0 to m_i(lambda),1-2^(-k))), and m_i(lambda) is the multiplicity of i in the partition lambda (proved).
EXAMPLE
a(2) = 1, the matrix is [[1,0],[0,1]].
CROSSREFS
Cf. A006950 which counts the partitions involved.
Sequence in context: A028231 A326277 A025988 * A023949 A025972 A028029
KEYWORD
nonn,more
AUTHOR
Victor S. Miller, Jan 13 2016
STATUS
approved