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 A060584 #9 Jul 14 2024 13:24:20
%S A060584 0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,
%T A060584 1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,
%U A060584 1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1,1,1,0,0,1,1,1,0,1
%N A060584 Compare ultimate and penultimate digits of n base 3, i.e., 0 if n mod 3 = floor(n/3) mod 3, 1 otherwise; also 0 if (n mod 9) is a multiple of 4, 1 otherwise.
%F A060584 a(n) = a(n-9) = A060585(n) mod 2.
%F A060584 G.f.: x(1+x+x^2)(1+x^4)/(1-x^9).
%F A060584 a(n) = signum((n mod 9) mod 4). - _Alois P. Heinz_, Jul 14 2024
%t A060584 PadRight[{},120,{0,1,1,1,0,1,1,1,0}] (* _Harvey P. Dale_, Feb 12 2022 *)
%K A060584 base,easy,nonn
%O A060584 0,1
%A A060584 _Henry Bottomley_, Apr 04 2001