The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A136463 Diagonal of square array A136462: a(n) = C((n+1)*2^(n-1), n) for n>=0. 3
 1, 2, 15, 560, 91390, 61124064, 163995687856, 1756185841659392, 75079359427627897200, 12831653340946454374300160, 8777916355714456994772455584000, 24054320541767107204031746600673906688 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS a(n) is divisible by (n+1) for n>=0: a(n)/(n+1) = A136464(n). LINKS Table of n, a(n) for n=0..11. FORMULA a(n) = [x^n] Sum_{i>=0} ((n+1)/2)^i * log(1 + 2^i*x)^i/i!. a(n) is found in row n, column 0, of matrix power A136467^(n+1) for n>=0. a(n) ~ exp(n+1) * 2^(n*(n-1)) / sqrt(2*Pi*n). - Vaclav Kotesovec, Jul 02 2016 MATHEMATICA Table[Binomial[(n+1)2^(n-1), n], {n, 0, 15}] (* Harvey P. Dale, Apr 20 2011 *) PROG (PARI) a(n)=binomial((n+1)*2^(n-1), n) (PARI) /* a(n) = Coefficient of x^n in series: */ a(n)=polcoeff(sum(i=0, n, ((n+1)/2)^i*log(1+2^i*x +x*O(x^n))^i/i!), n) CROSSREFS Cf. A136462; A136464; rows: A136465, A014070, A136466, A101346; A136467. Sequence in context: A357856 A177394 A367770 * A361210 A078475 A015185 Adjacent sequences: A136460 A136461 A136462 * A136464 A136465 A136466 KEYWORD nonn AUTHOR Paul D. Hanna, Dec 31 2007 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.

Last modified March 1 08:00 EST 2024. Contains 370430 sequences. (Running on oeis4.)