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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136637 a(n) = Sum_{k=0..n} C(n, k) * C(2^k*3^(n-k), n). 3
1, 5, 72, 6089, 3326498, 12405917044, 336474648380394, 69883583587428350874, 115099747754889610404191160, 1536533057081060754026861201898620, 168527150638482484315370462123098294514192 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Equals row sums of triangle A136635.

FORMULA

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

EXAMPLE

More generally,

if Sum_{n>=0} log(1 + (p^n + r*q^n)*x )^n / n! = Sum_{n>=0} b(n)*x^n,

then b(n) = Sum_{k=0..n} C(n,k)*r^(n-k) * C(p^k*q^(n-k), n)

(a result due to Vladeta Jovovic (vladeta(AT)EUnet.yu), Jan 13 2008).

PROG

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

CROSSREFS

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

Sequence in context: A079340 A197324 A197977 * A138623 A206280 A070526

Adjacent sequences:  A136634 A136635 A136636 * A136638 A136639 A136640

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 15 12:01 EST 2012. Contains 205782 sequences.