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 A132367 #26 Dec 12 2023 08:54:38
%S A132367 1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,
%T A132367 -1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,
%U A132367 1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2,1,1,2,-1,-1,-2
%N A132367 Period 6: repeat [1, 1, 2, -1, -1, -2].
%C A132367 Nonsimple continued fraction expansion of 1+1/sqrt(3) = 1 + A020760. - _R. J. Mathar_, Mar 08 2012
%H A132367 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,-1).
%F A132367 a(n) = cos(Pi*n/3)/3+sqrt(3)*sin(Pi*n/3)+2*(-1)^n/3. - _R. J. Mathar_, Oct 08 2011
%F A132367 From _Wesley Ivan Hurt_, Jun 19 2016: (Start)
%F A132367 G.f.: (1+x+2*x^2)/(1+x^3).
%F A132367 a(n) + a(n-3) = 0 for n>2. (End)
%p A132367 A132367:=n->[1, 1, 2, -1, -1, -2][(n mod 6)+1]: seq(A132367(n), n=0..100); # _Wesley Ivan Hurt_, Jun 19 2016
%t A132367 PadRight[{}, 120, {1,1,2,-1,-1,-2}] (* _Harvey P. Dale_, Jul 28 2012 *)
%o A132367 (PARI) a(n)=[1,1,2,-1,-1,-2][n%6+1] \\ _Charles R Greathouse IV_, Jun 02 2011
%o A132367 (Magma) &cat[[1, 1, 2, -1, -1, -2]^^20]; // _Wesley Ivan Hurt_, Jun 19 2016
%Y A132367 Cf. A020760, A061347, A100051, A100063, A122876.
%K A132367 sign,easy,less
%O A132367 0,3
%A A132367 _Paul Curtz_, Nov 09 2007