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.

A136636 a(n) = n * C(2*3^(n-1), n) for n>=1.

This page as a plain text file.
%I A136636 #11 Jul 02 2016 07:07:52
%S A136636 2,30,2448,1265004,4368213360,106458751541142,19173684851378353296,
%T A136636 26413015283743616538733008,285290979402099025600644272168880,
%U A136636 24601033850235942230699563821233785600080
%N A136636 a(n) = n * C(2*3^(n-1), n) for n>=1.
%C A136636 Equals column 1 of triangle A136635.
%F A136636 a(n) ~ 2^n * 3^(n*(n-1)) / (n-1)!. - _Vaclav Kotesovec_, Jul 02 2016
%p A136636 A136636:=n->n*binomial(2*3^(n-1), n); seq(A136636(n), n=1..10); # _Wesley Ivan Hurt_, Apr 29 2014
%t A136636 Table[n*Binomial[2*3^(n - 1), n], {n, 10}] (* _Wesley Ivan Hurt_, Apr 29 2014 *)
%o A136636 (PARI) {a(n)=n*binomial(2*3^(n-1),n)}
%Y A136636 Cf. A136635 (triangle), A014070 (main diagonal), A136393 (column 0), A136637 (row sums), A136638 (antidiagonal sums).
%K A136636 nonn,easy
%O A136636 1,1
%A A136636 _Vladeta Jovovic_ and _Paul D. Hanna_, Jan 15 2008