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.

A348309 a(n) = Sum_{k=0..floor(n/8)} (-1)^k * binomial(n-4*k,4*k).

This page as a plain text file.
%I A348309 #20 Oct 18 2022 15:30:46
%S A348309 1,1,1,1,1,1,1,1,0,-4,-14,-34,-69,-125,-209,-329,-493,-705,-955,-1199,
%T A348309 -1324,-1092,-56,2560,8025,18313,36353,66273,113525,184653,286257,
%U A348309 422377,589028,763912,888378,837502,372835,-928725,-3776537,-9302337,-19226889,-36034869,-63099331,-104630831,-165212760
%N A348309 a(n) = Sum_{k=0..floor(n/8)} (-1)^k * binomial(n-4*k,4*k).
%H A348309 Seiichi Manyama, <a href="/A348309/b348309.txt">Table of n, a(n) for n = 0..1000</a>
%H A348309 <a href="/index/Rec#order_08">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1,0,0,0,-1).
%F A348309 G.f.: (1-x)^3/((1-x)^4 + x^8).
%F A348309 a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) - a(n-8).
%t A348309 LinearRecurrence[{4, -6, 4, -1, 0, 0, 0, -1}, {1, 1, 1, 1, 1, 1, 1, 1}, 45] (* _Amiram Eldar_, Oct 11 2021 *)
%o A348309 (PARI) a(n) = sum(k=0, n\8, (-1)^k*binomial(n-4*k, 4*k));
%o A348309 (PARI) my(N=66, x='x+O('x^N)); Vec((1-x)^3/((1-x)^4+x^8))
%Y A348309 Cf. A348308, A348310.
%Y A348309 Cf. A099586, A348289.
%K A348309 sign,easy
%O A348309 0,10
%A A348309 _Seiichi Manyama_, Oct 11 2021