The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A053776 Number of n X n binary matrices of order dividing 11 (i.e., number of solutions of X^11=I in GL(n,2)). 1
 1, 1, 1, 1, 1, 1, 1, 1, 1, 358201502736997192984166401, 750836199529096452135514747699201, 1049488806253789856936937093744033792001, 1257525074216198249058077510927708275605504001, 1406432139324346089084141831613688810103123424051201 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,10 REFERENCES V. Jovovic, The cycle index polynomials of some classical groups, Belgrade, 1995, unpublished. LINKS Kent E. Morrison, Integer Sequences and Matrices Over Finite Fields, Journal of Integer Sequences, Vol. 9 (2006), Article 06.2.1. PROG (PARI) \\ See A053725 for F(n, q, k). F(15, 2, 11) \\ Andrew Howroyd, Jul 09 2018 CROSSREFS Cf. A053722, A053725, A053718. Sequence in context: A219322 A280349 A215403 * A217413 A217428 A146561 Adjacent sequences:  A053773 A053774 A053775 * A053777 A053778 A053779 KEYWORD nonn AUTHOR Vladeta Jovovic, Mar 24 2000 STATUS approved

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

Last modified November 23 21:51 EST 2020. Contains 338603 sequences. (Running on oeis4.)