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 A010704 #57 Aug 17 2024 23:25:49
%S A010704 3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,
%T A010704 3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,3,6,
%U A010704 3,6,3,6,3,6,3,6,3,6,3,6,3
%N A010704 Period 2: repeat (3,6).
%C A010704 Continued fraction expansion of A176105. - _R. J. Mathar_, Mar 08 2012
%C A010704 Digital roots of A007283. - _Bruno Berselli_, Nov 22 2018
%C A010704 Decimal expansion of 4/11. - _Franklin T. Adams-Watters_, Nov 28 2018
%H A010704 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A010704 G.f. 3*(1 + 2*x)/((1 - x)*(1 + x)). - _R. J. Mathar_, Nov 21 2011
%F A010704 From _Reinhard Zumkeller_, Jul 03 2012: (Start)
%F A010704 a(n) = 3*A000034(n).
%F A010704 a(n) = A213999(n,2). (End)
%F A010704 a(n + 1) = 9 - a(n). - _David A. Corneth_, Nov 29 2018
%F A010704 a(n) = 2 + 2^(1 - (-1)^n). - _Vincenzo Librandi_, Feb 28 2020
%F A010704 a(n) = 3*(3-(-1)^n)/2. - _Aaron J Grech_, Aug 02 2024
%p A010704 seq(op([3,6]),n=1..60); # _Muniru A Asiru_, Nov 29 2018
%t A010704 PadRight[{},120,{3,6}] (* _Harvey P. Dale_, Dec 12 2012 *)
%o A010704 (PARI) a(n)=3+n%2*3 \\ _Charles R Greathouse IV_, Dec 21 2011
%o A010704 (Haskell)
%o A010704 a010704 n = (* 3) . a000034
%o A010704 a010704_list = cycle [3,6] -- _Reinhard Zumkeller_, Jul 03 2012
%o A010704 (GAP) Flat(List([1..60], n->[3,6])); # _Muniru A Asiru_, Nov 29 2018
%o A010704 (Magma) &cat [[3, 6]^^50]; // _Vincenzo Librandi_, Feb 28 2020
%Y A010704 Cf. A000034, A007283, A176105, A213999.
%K A010704 nonn,easy
%O A010704 0,1
%A A010704 _N. J. A. Sloane_