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 A053290 #52 Jul 06 2025 02:54:46
%S A053290 1,2,48,11232,24261120,475566474240,84129611558952960,
%T A053290 134068444202678083338240,1923442429811445711790394572800,
%U A053290 248381049201184165590947520186915225600,288678833735376059528974260112416365258106470400
%N A053290 Number of nonsingular n X n matrices over GF(3).
%H A053290 Vincenzo Librandi, <a href="/A053290/b053290.txt">Table of n, a(n) for n = 0..45</a>
%H A053290 Jeffrey Overbey, William Traves, and Jerzy Wojdylo, <a href="https://doi.org/10.1080/0161-110591893771">On the Keyspace of the Hill Cipher</a>, Cryptologia, Vol. 29, Iss. 1 (2005), pp. 59-72; <a href="http://jeff.over.bz/papers/undergrad/on-the-keyspace-of-the-hill-cipher.pdf">author's copy</a>.
%F A053290 a(n) = Product_{k=0..n-1}(3^n-3^k). - corrected by _Michel Marcus_, Sep 18 2015
%F A053290 a(n) = A047656(n)*A027871(n). - _Bruno Berselli_, Jan 30 2013
%F A053290 From _Amiram Eldar_, Jul 06 2025: (Start)
%F A053290 a(n) = Product_{k=1..n} A219205(k).
%F A053290 a(n) ~ c * 3^(n^2), where c = A100220. (End)
%t A053290 Table[Product[3^n - 3^k, {k, 0, n - 1}], {n, 0, 10}] (* _Geoffrey Critzer_, Jan 26 2013; edited by _Vincenzo Librandi_, Jan 28 2013 *)
%o A053290 (Magma) [1] cat [&*[(3^n - 3^k): k in [0..n-1]]: n in [1..9]]; // _Bruno Berselli_, Jan 28 2013
%o A053290 (PARI) for(n=0,10, print1(prod(k=0,n-1, 3^n - 3^k), ", ")) \\ _G. C. Greubel_, May 31 2018
%Y A053290 Column k=3 of A316622.
%Y A053290 Cf. A002884, A003787, A027871, A047656, A053291, A053292, A053293.
%Y A053290 Cf. A100220, A219205.
%K A053290 nonn,easy
%O A053290 0,2
%A A053290 _Stephen G Penrice_, Mar 04 2000
%E A053290 More terms from _Vladeta Jovovic_, Mar 16 2000