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.

A382394 a(n) = Sum_{k=0..n} A128899(n,k)^3.

Original entry on oeis.org

1, 1, 9, 190, 5705, 204876, 8209278, 354331692, 16140234825, 765868074400, 37525317999884, 1886768082651816, 96906387191038334, 5066711735118128200, 268954195756648761900, 14464077426547576156440, 786729115199980286001225, 43219452658242723841261800
Offset: 0

Views

Author

Seiichi Manyama, Mar 24 2025

Keywords

Comments

Let b_k(n) = Sum_{j=0..n} A128899(n,j)^k. b_1(n) = binomial(2*n-1,n) = A088218(n) and b_2(n) = A024492(n-1) for n > 0.

Crossrefs

Programs

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

Formula

a(n) = binomial(2*n,n)/2 * A183069(n) for n > 0.
a(n) = A003161(2*n-1) for n > 0.