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.

A371786 a(n) = Sum_{k=0..floor(n/2)} (-1)^k * binomial(4*n-k,n-2*k).

Original entry on oeis.org

1, 4, 27, 209, 1716, 14553, 125971, 1105885, 9809019, 87691592, 788832045, 7131655908, 64743390321, 589808771881, 5389066722654, 49365637128655, 453212161425716, 4168951499299185, 38415242186255419, 354527945536409116, 3276414018301664025
Offset: 0

Views

Author

Seiichi Manyama, Apr 06 2024

Keywords

Crossrefs

Programs

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

Formula

a(n) = [x^n] 1/((1-x+x^2) * (1-x)^(3*n)).