login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136466 Row 2 of square array A136462: a(n) = C(3*2^(n-1), n) for n>=0. 3

%I #7 Jul 02 2016 07:18:06

%S 1,3,15,220,10626,1712304,927048304,1708566412608,10895665708319184,

%T 244373929798154341120,19561373281624772727757056,

%U 5658395223117478029148167447552,5975982733408602667847206514763365888

%N Row 2 of square array A136462: a(n) = C(3*2^(n-1), n) for n>=0.

%C a(n) is found in row n, column 0, of matrix cube A136467^3 for n>=0.

%F a(n) = [x^n] Sum_{i>=0} (3/2)^i * log(1 + 2^i*x)^i/i!.

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

%t Table[Binomial[3*2^(n-1),n], {n,0,15}] (* _Vaclav Kotesovec_, Jul 02 2016 *)

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

%o (PARI) /* T(n,k) = Coefficient of x^k in series: */ a(n)=polcoeff(sum(i=0,n,(3/2)^i*log(1+2^i*x +x*O(x^n))^i/i!),n)

%Y Cf. A136462; other rows: A136465, A014070, A101346; A136467.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Dec 31 2007

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 20 12:36 EDT 2024. Contains 371844 sequences. (Running on oeis4.)