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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A086190 Sum of rank(M) over all n X n matrices over GF(3). 2
 0, 2, 128, 50258, 152583680, 3848135499362, 831635515536146048, 1565118078583425627499058, 25891049952879626239605534955520, 3786985075909223206935197348611801222082, 4916838220400668315060476949839366817233722142848 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS 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. PROG (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 * A024345 A012524 A012670 Adjacent sequences:  A086187 A086188 A086189 * A086191 A086192 A086193 KEYWORD nonn AUTHOR Yuval Dekel (dekelyuval(AT)hotmail.com), Aug 26 2003 EXTENSIONS More terms from Benoit Cloitre, Aug 27 2003 a(10) from Andrew Howroyd, Jul 08 2018 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 30 22:59 EST 2021. Contains 349426 sequences. (Running on oeis4.)