Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086098
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086098 Sum of rank(M) over all n X n matrices over GF(2). +0
3
1, 21, 1141, 208965, 139889701, 354550756581, 3464730268306021 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) <= A086875(n).

FORMULA

For prime power q the number of rank-r n X n matrices over GF(q) is F(r, n) = product j=0..(r-1) (q^n-q^j)^2/(q^r-q^j) so a(n) = sum r=1..n r*product j=0..(r-1) (q^n-q^j)^2/(q^r-q^j) . In this case q=2.

CROSSREFS

Cf. A086875.

Sequence in context: A143003 A012183 A012230 this_sequence A086875 A012211 A036059

Adjacent sequences: A086095 A086096 A086097 this_sequence A086099 A086100 A086101

KEYWORD

nonn

AUTHOR

Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 24 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research