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.

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

Original entry on oeis.org

1, 2, 6, 21, 78, 297, 1145, 4447, 17358, 68001, 267141, 1051767, 4148281, 16385111, 64797543, 256515731, 1016368078, 4030114641, 15990813773, 63485616391, 252175202373, 1002136689071, 3984080489263, 15844839393411, 63036297959993, 250855287692647
Offset: 0

Views

Author

Seiichi Manyama, Jan 28 2023

Keywords

Crossrefs

Programs

  • Maple
    A360168 := proc(n)
        add(binomial(2*n,n-3*k),k=0..n/3) ;
    end proc:
    seq(A360168(n),n=0..70) ; # R. J. Mathar, Mar 12 2023
  • Mathematica
    a[n_] := Sum[Binomial[2*n, n - 3*k], {k, 0, Floor[n/3]}]; Array[a, 26, 0] (* Amiram Eldar, Jan 28 2023 *)
  • PARI
    a(n) = sum(k=0, n\3, binomial(2*n, n-3*k));
    
  • PARI
    my(N=30, x='x+O('x^N)); Vec(1/(sqrt(1-4*x)*(1-x^3*(2/(1+sqrt(1-4*x)))^6)))

Formula

G.f.: 1 / ( sqrt(1-4*x) * (1 - x^3 * c(x)^6) ), where c(x) is the g.f. of A000108.
D-finite with recurrence n*a(n) +2*(-4*n+3)*a(n-1) +8*(2*n-3)*a(n-2) +3*(-n+2)=0. - R. J. Mathar, Mar 12 2023
a(n) = [x^n] 1/(((1-x)^3-x^3) * (1-x)^(n-2)). - Seiichi Manyama, Apr 10 2024