Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086875
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086875 Sum of rank(M) over all n X n matrices over Z with all entries zero or one. +0
2
1, 21, 1147, 211965, 143331811 (list; graph; listen)
OFFSET

1,2

PROGRAM

(MAGMA) for a in [1..5] do b := 0; for c in CartesianPower([0, 1], a^2) do b + := Rank(Matrix(a, a, [aa : aa in c])); end for; print b; end for;

CROSSREFS

Sequence in context: A012183 A012230 A086098 this_sequence A012211 A036059 A036519

Adjacent sequences: A086872 A086873 A086874 this_sequence A086876 A086877 A086878

KEYWORD

hard,more,nonn

AUTHOR

Tom Womack (tom(AT)womack.net), Aug 21 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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research