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.
%I A107332 #16 Dec 26 2022 04:58:55
%S A107332 0,1,0,0,-1,-1,-1,-1,-1,-2,-3,-5,-7,-10,-14,-20,-29,-42,-61,-88,-127,
%T A107332 -183,-264,-381,-550,-794,-1146,-1654,-2387,-3445,-4972,-7176,-10357,
%U A107332 -14948,-21574,-31137,-44939,-64859,-93609,-135103,-194990,-281423,-406169,-586211,-846060,-1221092,-1762364
%N A107332 Expansion of x^2*(-1+x+x^2)/(-1+x+x^2-x^3+x^5).
%H A107332 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1,0,1).
%F A107332 a(n) = a(n-1) + a(n-2) - a(n-3) + a(n-5) for n>=5.
%F A107332 O.g.f.: x^2*(-1+x+x^2)/(-1+x+x^2-x^3+x^5). - _R. J. Mathar_, Dec 02 2007
%F A107332 a(n) = A107293(n+2)-A107293(n+1)-A107293(n). - _R. J. Mathar_, Dec 17 2017
%p A107332 a[0]:=0:a[1]:=1:a[2]:=0:a[3]:=0:a[4]:=-1:
%p A107332 for n from 5 to 46 do a[n]:=a[n-1]+a[n-2]-a[n-3]+a[n-5] od:
%p A107332 seq(a[n],n=0..46);
%t A107332 LinearRecurrence[{1,1,-1,0,1},{0,1,0,0,-1},50] (* _Harvey P. Dale_, Oct 11 2015 *)
%K A107332 sign,easy
%O A107332 1,10
%A A107332 _Roger L. Bagula_, Jun 08 2005
%E A107332 Edited by _N. J. A. Sloane_, May 13 2006
%E A107332 New name using g.f. from _Joerg Arndt_, Dec 26 2022