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.

A386611 a(n) = Sum_{k=0..n-1} binomial(4*k,k) * binomial(4*n-4*k,n-k-1).

Original entry on oeis.org

0, 1, 12, 126, 1268, 12513, 122148, 1184364, 11432100, 109997460, 1055891248, 10117633542, 96812495820, 925334377822, 8836315646616, 84317468847768, 804064275489924, 7663595943744876, 73009005101019792, 695263276434909976, 6618709687608909648, 62989317586872238689
Offset: 0

Views

Author

Seiichi Manyama, Jul 27 2025

Keywords

Crossrefs

Programs

  • PARI
    a(n) = sum(k=0, n-1, binomial(4*k, k)*binomial(4*n-4*k, n-k-1));

Formula

G.f.: g^2 * (g-1)/(4-3*g)^2 where g=1+x*g^4.
G.f.: g/((1-g) * (1-4*g)^2) where g*(1-g)^3 = x.
a(n) = Sum_{k=0..n-1} binomial(4*k+l,k) * binomial(4*n-4*k-l,n-k-1) for every real number l.
a(n) = Sum_{k=0..n-1} 3^(n-k-1) * binomial(4*n+1,k).
a(n) = Sum_{k=0..n-1} 4^(n-k-1) * binomial(3*n+k+1,k).