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 A131079 #23 Apr 18 2024 09:28:46
%S A131079 2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,
%T A131079 2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,
%U A131079 0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2,2,2,1,0,0,0,1,2
%N A131079 Periodic sequence (2, 2, 2, 1, 0, 0, 0, 1).
%C A131079 Second column of triangular array T defined in A131074.
%H A131079 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,-1,1).
%F A131079 a(n) = a(n-8).
%F A131079 G.f.: x*(2-x^3+x^4)/((1-x)*(1+x^4)).
%t A131079 PadRight[{},120,{2,2,2,1,0,0,0,1}] (* _Harvey P. Dale_, Mar 04 2020 *)
%o A131079 (PARI) {m=105; for(n=1, m, r=(n-1)%8; print1(if(r<3, 2, if(r==3||r==7, 1, 0)), ","))}
%o A131079 (Magma) m:=105; [ [2, 2, 2, 1, 0, 0, 0, 1][(n-1) mod 8 + 1]: n in [1..m] ];
%Y A131079 Cf. A131074, A131026.
%K A131079 nonn,easy,less
%O A131079 1,1
%A A131079 _Klaus Brockhaus_, following a suggestion of _Paul Curtz_, Jun 14 2007