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.

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

Original entry on oeis.org

1, 1, -1, -5, 5, 56, -29, -923, -119, 19855, 17711, -524160, -926771, 16339441, 45275035, -585443909, -2298643951, 23626165600, 124604211943, -1056587815835, -7261611779179, 51645640102519, 455056929514067, -2724884512463520, -30595315890959975
Offset: 0

Views

Author

Seiichi Manyama, Jan 09 2024

Keywords

Crossrefs

Programs

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

Formula

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