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.

A387626 a(n) = Sum_{k=0..floor(n/4)} 2^k * binomial(2*n-6*k+1,2*k).

Original entry on oeis.org

1, 1, 1, 1, 7, 21, 43, 73, 131, 297, 715, 1593, 3259, 6553, 13723, 29833, 64827, 137881, 289179, 608329, 1293083, 2762457, 5885179, 12478601, 26418363, 56028761, 119072987, 253139017, 537620571, 1140840793, 2420927291, 5139947401, 10916332411, 23182447833
Offset: 0

Views

Author

Seiichi Manyama, Sep 03 2025

Keywords

Crossrefs

Programs

  • Magma
    [&+[2^k* Binomial(2*n-6*k+1, 2*k): k in [0..Floor (n/4)]]: n in [0..35]]; // Vincenzo Librandi, Sep 04 2025
  • Mathematica
    Table[Sum[2^k*Binomial[2*n-6*k+1,2*k],{k,0,Floor[n/4]}],{n,0,40}] (* Vincenzo Librandi, Sep 04 2025 *)
  • PARI
    a(n) = sum(k=0, n\4, 2^k*binomial(2*n-6*k+1, 2*k));
    

Formula

G.f.: (1-x+2*x^4)/((1-x+2*x^4)^2 - 8*x^4).
a(n) = 2*a(n-1) - a(n-2) + 4*a(n-4) + 4*a(n-5) - 4*a(n-8).