cp's OEIS Frontend

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.

A135265 Period 6: repeat [1, 1, 1, 2, 2, 2].

This page as a plain text file.
%I A135265 #31 Feb 27 2024 03:02:39
%S A135265 1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,
%T A135265 2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,
%U A135265 1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1,2,2,2,1,1,1
%N A135265 Period 6: repeat [1, 1, 1, 2, 2, 2].
%H A135265 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,-1,1).
%F A135265 G.f.: (1+2*x^3)/((1-x)*(1+x)*(1-x+x^2)). [_Jaume Oliver Lafont_, Aug 30 2009]
%F A135265 a(n) = 3/2 - cos(Pi*n/3)/3 - sin(Pi*n/3)/sqrt(3) - (-1)^n/6. - _R. J. Mathar_, Oct 08 2011
%F A135265 a(n) = 1+(1-(-1)^floor(n/3))/2. [_Bruno Berselli_, Jul 12 2013]
%F A135265 a(n) = a(n-1) - a(n-3) + a(n-4) for n>3. - _Wesley Ivan Hurt_, Jun 20 2016
%p A135265 A135265:=n->[1, 1, 1, 2, 2, 2][(n mod 6)+1]: seq(A135265(n), n=0..100); # _Wesley Ivan Hurt_, Jun 20 2016
%t A135265 PadRight[{}, 100, {1, 1, 1, 2, 2, 2}] (* _Wesley Ivan Hurt_, Jun 20 2016 *)
%o A135265 (PARI) a(n)=[1,1,1,2,2,2][n%6+1] \\ _Charles R Greathouse IV_, Jun 02 2011
%o A135265 (Magma) &cat[[1, 1, 1, 2, 2, 2]^^20]; // _Wesley Ivan Hurt_, Jun 20 2016
%Y A135265 Cf. A178331 (decimal expansion of (17+2*sqrt(210))/29). [_Klaus Brockhaus_, May 25 2010]
%K A135265 nonn,easy,less
%O A135265 0,4
%A A135265 _Paul Curtz_, Dec 02 2007
%E A135265 More terms from _Klaus Brockhaus_, May 25 2010