OFFSET
0,3
COMMENTS
Number of nilpotent n X n matrices X over GF(3), that is, the number of n X n matrices X over GF(3) satisfying X^k = 0 for some k >= 1.
More generally, Fine and Herstein prove that the probability that an n X n matrix over GF(p^m) is nilpotent is 1/p^(mn) and the probability that an n X n matrix over Z/mZ is nilpotent is 1/k^n, where k is the product of the distinct prime factors of m.
Is this the same sequence (apart from the initial term) as A053854? - Philippe Deléham, Dec 09 2007
[1,9,729,531441,3486784401,...] is the Hankel transform of A005159. - Philippe Deléham, Dec 10 2007
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..46
N. J. Fine and I. N. Herstein, The probability that a matrix be nilpotent, Illinois J. Math., 2 (1958), 499-504.
Joël Gay, Vincent Pilaud, The weak order on Weyl posets, arXiv:1804.06572 [math.CO], 2018.
M. Gerstenhaber, On the number of nilpotent matrices with coefficients in a finite field, Illinois J. Math., Vol. 5 (1961), 330-333.
FORMULA
Sequence given by the Hankel transform (see A001906 for definition) of A082181 = {1, 1, 10, 109, 1270, 15562, 198100, ...}; example: det([1, 1, 10, 109; 1, 10, 109, 1270; 10, 109, 1270, 15562; 109, 1270, 15562, 198100]) = 9^6 = 531441. - Philippe Deléham, Aug 20 2005
MATHEMATICA
Table[(3^(n^2 - n)), {n, 0, 20}] (* Vincenzo Librandi, Feb 24 2014 *)
PROG
(PARI) a(n) = 3^(n^2 - n); \\ Joerg Arndt, Feb 23 2014
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Stephen G Penrice, Mar 29 2000
EXTENSIONS
More terms from James A. Sellers, Apr 08 2000
STATUS
approved