Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136578
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136578 G.f.: A(x) = Sum_{n>=0} log( (1 + 2^n*x)*(1 + 3^n*x) )^n / n!. +0
1
1, 5, 78, 6527, 3450452, 12594729052, 338284182093366, 70004091118158663618, 115159273597941035104859580, 1536760523930850376685165570432060, 168534058834325412618424268506407590697776 (list; graph; listen)
OFFSET

0,2

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).

PROGRAM

(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

Adjacent sequences: A136575 A136576 A136577 this_sequence A136579 A136580 A136581

Sequence in context: A009485 A015056 A015973 this_sequence A057186 A106939 A142114

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 08 2008, Jan 23 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified January 7 17:35 EST 2009. Contains 152824 sequences.


AT&T Labs Research