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.

A371777 a(n) = Sum_{k=0..floor(n/3)} binomial(2*n+2,n-3*k).

Original entry on oeis.org

1, 4, 15, 57, 220, 858, 3368, 13276, 52479, 207861, 824527, 3274395, 13015081, 51769813, 206045841, 820475513, 3268499356, 13025237058, 51922543076, 207034128448, 825713206746, 3293865399518, 13142007903586, 52443095356218, 209304385553096, 835459642193284
Offset: 0

Views

Author

Seiichi Manyama, Apr 05 2024

Keywords

Crossrefs

Programs

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

Formula

a(n) = [x^n] 1/(((1-x)^3-x^3) * (1-x)^n).
a(n) = binomial(2*(n+1), n)*hypergeom([1, (1-n)/3, (2-n)/3, -n/3], [1+n/3, (4+n)/3, (5+n)/3], -1). - Stefano Spezia, Apr 06 2024
From Vaclav Kotesovec, Apr 08 2024: (Start)
Recurrence: n*a(n) = 3*(3*n-2)*a(n-1) - 6*(4*n-5)*a(n-2) + 8*(2*n-3)*a(n-3).
G.f.: (1 + sqrt(1-4*x))/(2*(1-x)*(1-4*x)).
a(n) ~ 2^(2*n+1)/3. (End)