login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136638 a(n) = Sum_{k=0..[n/2]} C(n-k, k) * C(3^(n-2*k)*2^k, n-k). 3
1, 3, 38, 2955, 1666194, 6775599252, 204212962736426, 47025953519744215608, 84798028785462127288681736, 1219731316443261012339196962784452, 141916030637329352970764084182705691263552 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Equals antidiagonal sums of triangle A136635.

FORMULA

G.f.: A(x) = Sum_{n>=0} log(1 + 3^n*x + 2^n*x^2)^n / n!.

EXAMPLE

More generally, if Sum_{n>=0} log(1 + b*p^n*x + d*q^n*x^2)^n/n! = Sum_{n>=0} a(n)*x^n then a(n) = Sum_{k=0..[n/2]} C(n-k,k)*b^(n-2k)*d^k*C(p^(n-2k)*q^k,n-k).

PROG

(PARI) {a(n)=sum(k=0, n\2, binomial(n-k, k)*binomial(3^(n-2*k)*2^k, n-k))} (PARI) /* Using g.f.: */ {a(n)=polcoeff(sum(i=0, n, log(1+3^i*x+2^i*x^2)^i/i!), n, x)}

CROSSREFS

Cf. A136635 (triangle), A014070 (main diagonal), A136393 (column 0), A136636 (column 1), A136637 (row sums).

Sequence in context: A158119 A062155 A099022 * A163789 A183182 A134106

Adjacent sequences:  A136635 A136636 A136637 * A136639 A136640 A136641

KEYWORD

nonn

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs) and Paul D. Hanna (pauldhanna(AT)juno.com), Jan 15 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 01:31 EST 2012. Contains 205860 sequences.