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.

A105899 Period 6: repeat [1, 1, 2, 2, 3, 3].

This page as a plain text file.
%I A105899 #38 Mar 31 2024 15:07:09
%S A105899 1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,
%T A105899 3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,
%U A105899 2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2,2,3,3,1,1,2
%N A105899 Period 6: repeat [1, 1, 2, 2, 3, 3].
%H A105899 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,-1,1,-1,1).
%F A105899 G.f.: -(3*x^4+2*x^2+1)/(x-1)/(x^2+x+1)/(x^2-x+1). a(n) = A131555(n)+1. - _R. J. Mathar_, Nov 14 2007
%F A105899 From _Wesley Ivan Hurt_, Jun 17 2016: (Start)
%F A105899 a(n) = a(n-1) - a(n-2) + a(n-3) - a(n-4) + a(n-5) for n>4.
%F A105899 a(n) = (12-2*sqrt(3)*cos((1-4*n)*Pi/6)-6*sin((1+2*n)*Pi/6))/6. (End)
%F A105899 a(n) = floor(n/2) - 3*floor(n/6) + 1. - _Ridouane Oudra_, Sep 09 2023
%p A105899 A105899:=n->(12-2*sqrt(3)*cos((1-4*n)*Pi/6)-6*sin((1+2*n)*Pi/6))/6: seq(A105899(n), n=0..100); # _Wesley Ivan Hurt_, Jun 17 2016
%t A105899 Flatten[Table[{1, 1, 2, 2, 3, 3}, {20}]] (* _Wesley Ivan Hurt_, Jun 17 2016 *)
%t A105899 PadRight[{},120,{1,1,2,2,3,3}] (* _Harvey P. Dale_, May 09 2022 *)
%o A105899 (PARI) a(n)=1+n%6\2 \\ _Jaume Oliver Lafont_, Aug 30 2009
%o A105899 (Magma) &cat[[1, 1, 2, 2, 3, 3]: n in [0..20]]; // _Wesley Ivan Hurt_, Jun 17 2016
%Y A105899 Cf. A131555.
%Y A105899 Cf. A178308 Decimal expansion of (111+sqrt(25277))/158. [_Klaus Brockhaus_, May 24 2010]
%K A105899 nonn,easy,less
%O A105899 0,3
%A A105899 _Paul Curtz_, Aug 27 2007
%E A105899 Edited by _N. J. A. Sloane_, Sep 15 2007
%E A105899 More terms from _Klaus Brockhaus_, May 24 2010