The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053170 Number of 3 X 3 integer matrices with elements in the range [ -n,n ] which generate a group of finite order under matrix multiplication. 5
 1584, 13056, 57744, 133440, 307632, 519888, 990288, 1436208, 2108832, 3015648, 4075296 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS 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 LINKS Sean A. Irvine, Java program (github) FORMULA a(n) = 2*(1 + A053171(n) + A053172(n) + A053173(n) + A053174(n)). CROSSREFS Cf. A053171, A053172, A053173, A053174. Sequence in context: A242539 A224945 A306313 * A237916 A159211 A235844 Adjacent sequences: A053167 A053168 A053169 * A053171 A053172 A053173 KEYWORD nonn,more AUTHOR Ralf W. Grosse-Kunstleve, Mar 26 2000 EXTENSIONS a(11) from Sean A. Irvine, Dec 16 2021 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 1 23:44 EST 2022. Contains 358485 sequences. (Running on oeis4.)