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.

Showing 1-1 of 1 results.

A360274 a(n) = Sum_{k=0..floor(n/3)} Catalan(n-3*k).

Original entry on oeis.org

1, 1, 2, 6, 15, 44, 138, 444, 1474, 5000, 17240, 60260, 213012, 760140, 2734700, 9907857, 36117810, 132379490, 487546557, 1803381000, 6696499910, 24953813577, 93285944640, 349756113560, 1314857960901, 4955232346092, 18717109185712, 70848408876905
Offset: 0

Views

Author

Seiichi Manyama, Jan 31 2023

Keywords

Crossrefs

Programs

  • Maple
    A360274 := proc(n)
        add(A000108(n-3*k),k=0..n/3) ;
    end proc:
    seq(A360274(n),n=0..70) ; # R. J. Mathar, Mar 12 2023
  • PARI
    a(n) = sum(k=0, n\3, binomial(2*(n-3*k), n-3*k)/(n-3*k+1));
    
  • PARI
    my(N=30, x='x+O('x^N)); Vec(2/((1-x^3)*(1+sqrt(1-4*x))))

Formula

G.f.: c(x)/(1-x^3), where c(x) is the g.f. of A000108.
a(n) ~ 2^(2*n+6) / (63*sqrt(Pi)*n^(3/2)). - Vaclav Kotesovec, Feb 01 2023
D-finite with recurrence (n+1)*a(n) +2*(-2*n+1)*a(n-1) +(-n-1)*a(n-3) +2*(2*n-1)*a(n-4)=0. - R. J. Mathar, Mar 12 2023
Showing 1-1 of 1 results.