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”).
%I #12 Dec 16 2021 22:44:31
%S 1584,13056,57744,133440,307632,519888,990288,1436208,2108832,3015648,
%T 4075296
%N Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of finite order under matrix multiplication.
%C Count of 3 X 3 matrices M with det(M) = +- 1 such that M^k = I for some k <= 6. - _Sean A. Irvine_, Dec 16 2021
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a053/A053170.java">Java program</a> (github)
%F a(n) = 2*(1 + A053171(n) + A053172(n) + A053173(n) + A053174(n)).
%Y Cf. A053171, A053172, A053173, A053174.
%K nonn,more
%O 1,1
%A _Ralf W. Grosse-Kunstleve_, Mar 26 2000
%E a(11) from _Sean A. Irvine_, Dec 16 2021