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 A271970 #10 Jun 02 2025 12:18:00
%S A271970 1,0,1,0,1,3,3,5,8,12,20,31,48,76,119,187,294,461,724,1137,1785,2803,
%T A271970 4401,6910,10850,17036,26749,42000,65946,103545,162581,255276,400821,
%U A271970 629348,988169,1551571,2436195,3825185,6006104,9430468,14807224,23249523,36505176
%N A271970 Linear recurrence, with both signature and original terms = 1,0,1,0,1.
%H A271970 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1, 0, 1, 0, 1).
%F A271970 a(1)=1, a(2)=0, a(3)=1, a(4)=0, a(5)=1, a(n)=a(n-1)+a(n-3)+a(n-5).
%F A271970 G.f.: ( -x*(x-1)*(x^3-x^2-1) ) / ( -1+x+x^3+x^5 ). - _R. J. Mathar_, Apr 17 2016
%F A271970 a(n) = A060961(n) -A060961(n-2) -2*A060961(n-4). - _R. J. Mathar_, Apr 17 2016
%t A271970 With[{c={1,0,1,0,1}},LinearRecurrence[c,c,100]]
%K A271970 nonn,easy
%O A271970 1,6
%A A271970 _Harvey P. Dale_, Apr 17 2016