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 A053292 #40 Jul 06 2025 02:54:36
%S A053292 1,4,480,1488000,116064000000,226614960000000000,
%T A053292 11064475422000000000000000,13506266841692625000000000000000000,
%U A053292 412177498341354683437500000000000000000000000
%N A053292 Number of nonsingular n X n matrices over GF(5).
%H A053292 Vincenzo Librandi, <a href="/A053292/b053292.txt">Table of n, a(n) for n = 0..35</a>
%H A053292 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 A053292 a(n) = (5^n - 1)*(5^n - 5)*...*(5^n - 5^(n-1)).
%F A053292 a(n) = A109345(n)*A027872(n). - _Bruno Berselli_, Jan 30 2013
%F A053292 a(n) ~ c * 5^(n^2), where c = A100222. - _Amiram Eldar_, Jul 06 2025
%t A053292 Table[Product[5^n - 5^k, {k,0,n-1}], {n,0,10}] (* _Geoffrey Critzer_, Jan 26 2013 *)
%o A053292 (Magma) [1] cat [&*[(5^n - 5^k): k in [0..n-1]]: n in [1..8]]; // _Bruno Berselli_, Jan 28 2013
%o A053292 (PARI) for(n=0,10, print1(prod(k=0,n-1, 5^n - 5^k), ", ")) \\ _G. C. Greubel_, May 31 2018
%Y A053292 Column k=5 of A316622.
%Y A053292 Cf. A002884, A003789, A027872, A053290, A053291, A053293, A109345, A100222.
%K A053292 nonn,easy
%O A053292 0,2
%A A053292 _Stephen G Penrice_, Mar 04 2000
%E A053292 More terms from _Vladeta Jovovic_, Mar 16 2000