cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A177410 a(n) = binomial((n+1)*2^n, n)/(n+1).

Original entry on oeis.org

1, 2, 22, 1240, 316316, 343855008, 1551088459936, 28684932916796288, 2161788213413182113760, 661624062463590275090838016, 820418024446932078541699530057216
Offset: 0

Views

Author

Paul D. Hanna, Jun 26 2010

Keywords

Crossrefs

Programs

  • PARI
    {a(n)=binomial((n+1)*2^n,n)/(n+1)}
    
  • PARI
    {a(n)=polcoeff(sum(k=0, n, (n+1)^(k-1)*log(1+2^k*x +x*O(x^n))^k/k!), n)} \\ Paul D. Hanna, Jul 03 2010

Formula

a(n) = [x^n] (1 + x)^((n+1)*2^n)/(n+1).
a(n) = [x^n] Sum_{k=0..n} (n+1)^(k-1) * log(1 + 2^k*x)^k/k!. - Paul D. Hanna, Jul 03 2010