cp's OEIS Frontend

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.

Showing 1-2 of 2 results.

A088437 Number of n X n orthogonal matrices over GF(2) modulo permutations of rows.

Original entry on oeis.org

1, 1, 1, 2, 6, 32, 288, 4608, 130560, 6684672, 621674496, 106099113984, 33421220904960, 19556188689530880, 21359269286705627136, 43743783499173124374528, 168632285389312394463805440, 1227942828363775231508883701760, 16941927202935006869128068433182720, 444122456468619444070070837134825095168
Offset: 1

Views

Author

Yuval Dekel (dekelyuval(AT)hotmail.com), Nov 09 2003

Keywords

Comments

Also the number of distinct self-dual bases for GF(2^n) over GF(2). - Max Alekseyev, Feb 11 2008

Crossrefs

Programs

  • PARI
    /* based on http://home.gwu.edu/~maxal/gpscripts/nsdb.gp by Max Alekseyev */
    sd(m,q) =
    /* Number of distinct self-dual bases of GF(q^m) over GF(q) where q is a power of prime */
    {
       if ( q%2 && !(m%2), return(0) );
       return ( (q%2 + 1) * prod(i=1,m-1, q^i - (i+1)%2) / m! );
    }
    vector(66, n, sd(n,2)) /* Joerg Arndt, Jul 03 2011 */

Formula

a(n) = A003053(n) / n!.

Extensions

More terms from Max Alekseyev, Feb 11 2008

A135498 Number of self-dual normal bases of GF(2^n) with primitive field polynomial.

Original entry on oeis.org

0, 1, 1, 0, 1, 1, 1, 0, 2, 3, 3, 0, 5, 4, 11, 0, 17, 25, 27, 0, 57, 60, 87, 0, 200, 215, 428, 0, 562, 997, 961, 0, 2660, 2917
Offset: 1

Views

Author

Joerg Arndt, Feb 22 2008, Mar 02 2008

Keywords

Crossrefs

Cf. A135488.
Showing 1-2 of 2 results.