This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136636 a(n) = n * C(2*3^(n-1), n) for n>=1. 4

%I

%S 2,30,2448,1265004,4368213360,106458751541142,19173684851378353296,

%T 26413015283743616538733008,285290979402099025600644272168880,

%U 24601033850235942230699563821233785600080

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

%C Equals column 1 of triangle A136635.

%F a(n) ~ 2^n * 3^(n*(n-1)) / (n-1)!. - _Vaclav Kotesovec_, Jul 02 2016

%p A136636:=n->n*binomial(2*3^(n-1), n); seq(A136636(n), n=1..10); # _Wesley Ivan Hurt_, Apr 29 2014

%t Table[n*Binomial[2*3^(n - 1), n], {n, 10}] (* _Wesley Ivan Hurt_, Apr 29 2014 *)

%o (PARI) {a(n)=n*binomial(2*3^(n-1),n)}

%Y Cf. A136635 (triangle), A014070 (main diagonal), A136393 (column 0), A136637 (row sums), A136638 (antidiagonal sums).

%K nonn,easy

%O 1,1

%A _Vladeta Jovovic_ and _Paul D. Hanna_, Jan 15 2008

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 December 6 07:09 EST 2019. Contains 329785 sequences. (Running on oeis4.)