Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A136651
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A136651 Self-convolution of A014070: a(n) = Sum_{k=0..n} C(2^k,k)*C(2^(n-k),n-k). +0
1
1, 4, 16, 136, 3900, 410704, 150779216, 189354108224, 819706419291728, 12417873698752685696, 668556572391910046409088, 129665687275486846550512590336, 91623983383737723477835280780455168 (list; graph; listen)
OFFSET

0,2

FORMULA

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

PROGRAM

(PARI) {a(n)=sum(k=0, n, binomial(2^k, k)*binomial(2^(n-k), n-k))} (PARI) {a(n)=polcoeff(sum(m=0, n, sum(k=0, m, log(1+2^k*x +x*O(x^n))^k/k!*log(1+2^(m-k)*x +x*O(x^n))^(m-k)/(m-k)!)), n)}

CROSSREFS

Cf. A014070 (C(2^n, n)).

Sequence in context: A094356 A061129 A061131 this_sequence A005749 A005739 A005741

Adjacent sequences: A136648 A136649 A136650 this_sequence A136652 A136653 A136654

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jan 16 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 September 7 23:08 EDT 2008. Contains 143486 sequences.


AT&T Labs Research