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.

A177706 Period 5: repeat [1, 1, 1, 1, 2].

This page as a plain text file.
%I A177706 #33 Sep 03 2024 15:07:05
%S A177706 1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,
%T A177706 2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,
%U A177706 1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2,1,1,1,1,2
%N A177706 Period 5: repeat [1, 1, 1, 1, 2].
%C A177706 Continued fraction expansion of (5+sqrt(65))/8.
%C A177706 Decimal expansion of 3704/33333.
%H A177706 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).
%F A177706 a(n) = a(n-5) for n > 4; a(0) = 1, a(1) = 1, a(2) = 1, a(3) = 1, a(4) = 2.
%F A177706 G.f.: (1+x+x^2+x^3+2*x^4)/(1-x^5).
%F A177706 a(n) = A130782(n+3).
%F A177706 a(n+4) = A198517(n+2) + A198517(n+1) + A198517(n). - _Bruno Berselli_, Nov 02 2011
%F A177706 a(n) = floor((n+1)*6/5) - floor((n)*6/5). - _Hailey R. Olafson_, Jul 23 2014
%F A177706 a(n) = (2/5)*(3 + cos(4*(n-4)*Pi/5) + cos(2*(n+1)*Pi/5)). - _Wesley Ivan Hurt_, Oct 05 2018
%F A177706 a(n) = 2 - ((n+1)^4 mod 5). - _Aaron J Grech_, Aug 30 2024
%p A177706 A177706:=n->floor(6*(n+1)/5)-floor(6*n/5): seq(A177706(n), n=0..100); # _Wesley Ivan Hurt_, Jul 24 2014
%t A177706 Table[Floor[6 (n + 1)/5] - Floor[6 n/5], {n, 0, 100}] (* _Wesley Ivan Hurt_, Jul 24 2014 *)
%o A177706 (Magma) &cat[ [1, 1, 1, 1, 2]: k in [1..21] ];
%Y A177706 Cf. A130782 (repeat 1, 1, 2, 1, 1), A177707 (decimal expansion of (5+sqrt(65))/8).
%K A177706 nonn,cofr,easy
%O A177706 0,5
%A A177706 _Klaus Brockhaus_, May 11 2010