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 A010706 #39 Dec 14 2023 06:04:04
%S A010706 3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,
%T A010706 3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,3,8,
%U A010706 3,8,3,8,3,8,3,8,3,8,3,8,3
%N A010706 Period 2: repeat (3,8).
%C A010706 Continued fraction of (6+sqrt 42)/4. - _R. J. Mathar_, Nov 21 2011
%H A010706 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A010706 a(n) = -(5/2)*(-1)^n + 11/2. - _Paolo P. Lava_, Oct 20 2006
%F A010706 G.f.: (3+8x)/((1-x)(1+x)). - _R. J. Mathar_, Nov 21 2011
%F A010706 a(n) = 3 + 5*(n mod 2). - _Wesley Ivan Hurt_, Jun 16 2014
%p A010706 A010706:=n->3 + 5*(n mod 2); seq(A010706(n), n=0..50); # _Wesley Ivan Hurt_, Jun 16 2014
%t A010706 Table[3 + 5 Mod[n, 2], {n, 0, 50}] (* _Wesley Ivan Hurt_, Jun 16 2014 *)
%o A010706 (PARI) a(n)=3+[0,5][1+n%2]; /* Same as 3+5*(n%2) */ \\ _R. J. Cano_, Jun 16 2014
%o A010706 (Magma) [3 + 5*(n mod 2): n in [0..50]]; // _Wesley Ivan Hurt_, Jun 16 2014
%K A010706 nonn,easy
%O A010706 0,1
%A A010706 _N. J. A. Sloane_, Dec 11 1996