Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086190
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086190 Sum of rank(M) over all n X n matrices over GF(3). +0
2
0, 2, 128, 50258, 152583680, 3848135499362, 831635515536146048, 1565118078583425627499058, 25891049952879626239605534955520, 3786985075909223206935197348611801222082 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = sum r=1..n r*product j=0..(r-1) (q^n-q^j)^2/(q^r-q^j) with q=3.

PROGRAM

(PARI) a(n)=sum(r=1, n, r*prod(j=0, (r-1), (3^n-3^j)^2/(3^r-3^j)))

CROSSREFS

Cf. A086098.

Sequence in context: A010367 A024344 A012673 this_sequence A024345 A012524 A012670

Adjacent sequences: A086187 A086188 A086189 this_sequence A086191 A086192 A086193

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 27 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