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 A141212 #17 Jan 26 2023 16:14:26
%S A141212 1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,
%T A141212 0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,
%U A141212 1,1,0,0,1,0,1,1,0,0,1,0,1,1,0,0,1,0,1
%N A141212 a(n) = 1, if n == {1,3,4} mod 6; otherwise 0.
%H A141212 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,0,1).
%F A141212 a(n) = 1 if n is in A029739, otherwise 0.
%F A141212 Begin with the sequence S: (1,0,1,0,1,0,...) and create a hole every 3n-th place: 1,0_1,0_1,0_1,0_,... Then insert terms of the sequence S in the holes.
%F A141212 From _R. J. Mathar_, Jun 17 2008: (Start)
%F A141212 O.g.f.: x(1+x^2+x^3)/((1-x)(1+x)(x^2+x+1)(x^2-x+1)).
%F A141212 a(n) = 1/2+A049347(n-1)/2-(-1)^n/6-A087204(n)/6 = a(n-6). (End)
%F A141212 a(n) = ((Fibonacci(n+4) mod 4) mod 3) mod 2. - _Gary Detlefs_, Dec 29 2010
%e A141212 a(7) = 1 since 7 == 1 mod 6.
%t A141212 Table[If[MemberQ[{1,3,4},Mod[n,6]],1,0],{n,120}] (* or *) PadRight[{},120,{1,0,1,1,0,0}] (* _Harvey P. Dale_, May 03 2013 *)
%Y A141212 Cf. A029739, A049347.
%K A141212 nonn,easy
%O A141212 1,1
%A A141212 _Gary W. Adamson_, Jun 14 2008