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.

A378781 a(n) = n^3 * 2^n * binomial(3*n, n) / 3.

Original entry on oeis.org

0, 2, 160, 6048, 168960, 4004000, 85542912, 1701719040, 32133218304, 583116019200, 10255365120000, 175853140869120, 2953078190899200, 48728661198077952, 792158036489666560, 12713192776728576000, 201760465448645689344, 3170643145439310643200, 49394436443159427809280
Offset: 0

Views

Author

Amiram Eldar, Dec 07 2024

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_] := n^3 * 2^n * Binomial[3*n, n] / 3; Array[a, 25, 0]
  • PARI
    a(n) = n^3 * 2^n * binomial(3*n, n) / 3;

Formula

a(n) = A128789(n) * A005809(n) / 3.
a(n) = n * A378778(n) / 3.
a(n) = n^2 * A378780(n) / 3.
Sum_{n>=1} 1/a(n) = 3*G*Pi - Pi^2*log(2)/8 + log(2)^3/2 - 99*zeta(3)/16, where G is Catalan's constant (Chudnovsky and Chudnovsky, 1998).