login
A387869
a(n) = Sum_{k=0..n} binomial(2*n+1,4*k).
2
1, 1, 6, 36, 136, 496, 2016, 8256, 32896, 130816, 523776, 2098176, 8390656, 33550336, 134209536, 536887296, 2147516416, 8589869056, 34359607296, 137439215616, 549756338176, 2199022206976, 8796090925056, 35184376283136, 140737496743936, 562949936644096
OFFSET
0,3
FORMULA
G.f.: (1-3*x+6*x^2)/((1-4*x) * (1+4*x^2)).
a(n) = 4*a(n-1) - 4*a(n-2) + 16*a(n-3) for n > 2.
a(2*n) = A090407(n), a(2*n+1) = A090408(n).
a(n) = 2^(2*n-1) + (-1)^floor((n+1)/2)*2^(n-1).
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