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 A135033 #17 Apr 25 2024 09:22:57
%S A135033 2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,
%T A135033 0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,
%U A135033 8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0,2,4,6,8,0
%N A135033 Period 5: repeat [2, 4, 6, 8, 0].
%C A135033 "Cheerleader" sequence: reminiscent of the old cheer, "Two, Four, Six, Eight, Who do we appreciate?"
%H A135033 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%F A135033 a(n) = 2*((n+1) mod 5).
%F A135033 From _R. J. Mathar_, Feb 14 2008: (Start)
%F A135033 a(n) = 2*A010874(n+1).
%F A135033 O.g.f.: -2*(1 + 2x + 3x^2 + 4x^3)/((x-1)*(1 + x + x^2 + x^3 + x^4)). (End)
%e A135033 a(0) = 2*((0+1) mod 5) = 2*(1 mod 5) = 2.
%t A135033 PadRight[{},120,{2,4,6,8,0}] (* _Harvey P. Dale_, Nov 21 2018 *)
%Y A135033 Cf. A010874.
%K A135033 easy,nonn
%O A135033 0,1
%A A135033 _William A. Tedeschi_, Feb 10 2008