OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..700
Index entries for linear recurrences with constant coefficients, signature (4,-4,16).
FORMULA
MATHEMATICA
Table[Sum[Binomial[2*n+1, 4*k], {k, 0, n}], {n, 0, 25}] (* Vincenzo Librandi, Sep 14 2025 *)
a[n_] := 2^(2*n-1) + (-1)^Floor[(n+1)/2]*2^(n-1); Array[a, 26, 0] (* Amiram Eldar, Feb 10 2026 *)
PROG
(PARI) a(n) = sum(k=0, n, binomial(2*n+1, 4*k));
(Magma) [&+[Binomial(2*n+1, 4*k): k in [0..n]]: n in [0..25]]; // Vincenzo Librandi, Sep 14 2025
(Python)
def A387869(n): return 1 if n == 0 else (1<<(2*n-1))+(-1)**((n+1)//2)*(1<<(n-1)) # Aidan Chen, Feb 10 2026
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Sep 10 2025
STATUS
approved
