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!)
A136578 G.f.: A(x) = Sum_{n>=0} log( (1 + 2^n*x)*(1 + 3^n*x) )^n / n!. 0
1, 5, 78, 6527, 3450452, 12594729052, 338284182093366, 70004091118158663618, 115159273597941035104859580, 1536760523930850376685165570432060, 168534058834325412618424268506407590697776 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = Sum_{k=0..n} C(2^k*3^(n-k), k) * C(2^k*3^(n-k), n-k).
EXAMPLE
G.f. A(x) = 1 + 5*x + 78*x^2 + 6527*x^3 + 3450452*x^4 +...
A(x) = 1 + log((1+2x)(1+3x)) + log((1+4x)(1+9x))^2/2! + log((1+8x)(1+27x))^3/3! +...
More generally: if Sum_{n>=0} (1+p^n*x)^b*(1+q^n*x)^d * log((1+p^n*x)*(1+q^n*x))^n /n! = Sum_{n>=0} a(n)*x^n then a(n) = Sum_{k=0..n} C(p^k*q^(n-k)+b, k) * C(p^k*q^(n-k)+d, n-k).
PROG
(PARI) {a(n)=polcoeff(sum(i=0, n, log((1+2^i*x)*(1+3^i*x)+x*O(x^n))^i/i!), n)}
(PARI) {a(n)=sum(k=0, n, binomial(2^k*3^(n-k), k)*binomial(2^k*3^(n-k), n-k))}
CROSSREFS
Sequence in context: A214443 A015973 A363376 * A057186 A106939 A142114
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jan 08 2008, Jan 23 2008
STATUS
approved

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 07:43 EDT 2024. Contains 371799 sequences. (Running on oeis4.)