This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A053765 #18 Jul 02 2025 16:01:59 %S A053765 1,1,16,4096,16777216,1099511627776,1152921504606846976, %T A053765 19342813113834066795298816,5192296858534827628530496329220096, %U A053765 22300745198530623141535718272648361505980416 %N A053765 a(n) = 4^(n^2 - n). %C A053765 Number of nilpotent n X n matrices over GF(4). %C A053765 (-1)^n * resultant of the Chebyshev polynomial of first kind of degree n and Chebyshev polynomial of first kind of degree 2n (cf. A039991). - _Benoit Cloitre_, Jan 26 2003 %C A053765 a(n) is the number of spanning subgraphs (or equivalently sets of edges) in the n X n grid graph. - _Andrew Howroyd_, Jan 29 2023 %D A053765 N. J. Fine and I. N. Herstein, The probability that a matrix be nilpotent, Illinois J. Math., 2 (1958), 499-504. %D A053765 M. Gerstenhaber, On the number of nilpotent matrices with coefficients in a finite field. Illinois J. Math., Vol. 5 (1961), 330-333. %H A053765 Andrew Howroyd, <a href="/A053765/b053765.txt">Table of n, a(n) for n = 0..40</a> %o A053765 (PARI) a(n) = 4^(n^2 - n) \\ _Andrew Howroyd_, Jan 29 2023 %Y A053765 Cf. A053763, A053764. %K A053765 easy,nonn %O A053765 0,3 %A A053765 _Stephen G Penrice_, Mar 29 2000 %E A053765 More terms from _James Sellers_, Apr 08 2000