|
Search: id:A136637
|
|
|
| A136637 |
|
a(n) = Sum_{k=0..n} C(n, k) * C(2^k*3^(n-k), n). |
|
+0
4
|
|
| 1, 5, 72, 6089, 3326498, 12405917044, 336474648380394, 69883583587428350874, 115099747754889610404191160, 1536533057081060754026861201898620, 168527150638482484315370462123098294514192
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
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).
|
|
PROGRAM
|
(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: A092204 A079874 A079340 this_sequence A138623 A070526 A070530
Adjacent sequences: A136634 A136635 A136636 this_sequence A136638 A136639 A136640
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Vladeta Jovovic (vladeta(AT)eunet.rs) and Paul D. Hanna (pauldhanna(AT)juno.com), Jan 15 2008
|
|
|
Search completed in 0.002 seconds
|
