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 A131534 #85 Aug 04 2025 07:31:07
%S A131534 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,
%T A131534 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,
%U A131534 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
%N A131534 Period 3: repeat [1, 2, 1].
%C A131534 Partial sums of A106510. Inverse binomial transform of A024495 (without leading zeros). - _Philippe Deléham_, Nov 26 2008
%C A131534 a(n) = A130196(n) - A022003(n) = A080425(n) - A130196(n)+2 = A153727(n)/A130196(n). - _Reinhard Zumkeller_, Nov 12 2009
%C A131534 Continued fraction expansion of A177346, (1+sqrt(10))/3. - _Klaus Brockhaus_, May 07 2010
%C A131534 From _Daniel Forgues_, May 04 2016: (Start)
%C A131534 a(n) = GCD of terms of the sequence S_n = {F_i+F_{i+1}+F_{i+2}+...+F_{i+2n}, i >= 0}, where F_i denotes a Fibonacci number. See A210209.
%C A131534 a(n) = GCD of terms of the sequence S_n = {L_i+L_{i+1}+L_{i+2}+...+L_{i+2n}, i >= 0}, where L_i denotes a Lucas number. See A229339. (End)
%H A131534 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1).
%F A131534 G.f.: (x+1)^2/((1-x)*(x^2+x+1)). - _R. J. Mathar_, Nov 14 2007
%F A131534 a(n) = 4/3 + (2/3)*cos(2*Pi*(n+2)/3). - _Jaume Oliver Lafont_, May 09 2008
%F A131534 a(n) = A101825(n+1). - _R. J. Mathar_, Jun 13 2008
%F A131534 a(n) = gcd(F(n)^2+F(n+1)^2, F(n)+F(n+1)). - _Gary Detlefs_, Dec 29 2010
%F A131534 a(n) = 2 - ((n+2)^2 mod 3). - _Gary Detlefs_, Oct 13 2011
%F A131534 a(n) = ceiling(n*4/3) - ceiling((n-1)*4/3). - _Tom Edgar_, Jul 22 2014
%F A131534 a(n) = 2 - abs(3*floor(n/3)+1-n). - _Mikael Aaltonen_, Jan 02 2015
%F A131534 a(n) = 1+[3|(2n+1)], using Iverson bracket. - _Daniel Forgues_, May 04 2016
%F A131534 a(n) = a(n-3) for n>2. - _Wesley Ivan Hurt_, Jul 05 2016
%F A131534 E.g.f.: (4*exp(x) - exp(-x/2)*(cos(sqrt(3)*x/2) - sqrt(3)*sin(sqrt(3)*x/2)))/3. - _Stefano Spezia_, Aug 04 2025
%p A131534 A131534:=n->(-n mod 3)^(n mod 3): seq(A131534(n), n=0..100); # _Wesley Ivan Hurt_, Aug 29 2014
%t A131534 PadRight[{},120,{1,2,1}] (* _Harvey P. Dale_, Aug 06 2013 *)
%o A131534 (PARI) a(n)=1+(n%3==1) \\ _Jaume Oliver Lafont_, Mar 20 2009
%o A131534 (Magma) [(-n mod 3)^(n mod 3) : n in [0..100]]; // _Wesley Ivan Hurt_, Aug 29 2014
%Y A131534 Cf. A167808. - _Reinhard Zumkeller_, Nov 12 2009
%Y A131534 Cf. A000045, A022003, A024495, A080425, A101825, A106510, A130196, A153727, A177346, A210209, A229339.
%K A131534 nonn,easy
%O A131534 0,2
%A A131534 _Paul Curtz_, Aug 26 2007