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 A010703 #45 Aug 04 2024 22:05:24
%S A010703 3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,
%T A010703 3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,
%U A010703 3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5,3,5
%N A010703 Period 2: repeat (3,5).
%C A010703 From _Klaus Brockhaus_, Dec 10 2009: (Start)
%C A010703 Interleaving of A010701 and A010716.
%C A010703 Also continued fraction expansion of (15+sqrt(285))/10.
%C A010703 Also decimal expansion of 35/99.
%C A010703 Binomial transform of 3 followed by A084633 without initial terms 1,0.
%C A010703 Inverse binomial transform of A171497. (End)
%H A010703 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A010703 From _Klaus Brockhaus_, Dec 10 2009: (Start)
%F A010703 a(n) = a(n-2) for n > 1; a(0) = 3, a(1) = 5.
%F A010703 G.f.: (3+5*x)/((1-x)*(1+x)). (End)
%F A010703 a(n) = 4 - (-1)^n. - _Aaron J Grech_, Aug 02 2024
%F A010703 E.g.f.: 3*cosh(x) + 5*sinh(x). - _Stefano Spezia_, Aug 04 2024
%t A010703 Table[If[OddQ[n], 3, 5], {n, 1, 50}] (* _Stefan Steinerberger_, Apr 10 2006 *)
%t A010703 PadRight[{},120,{3,5}] (* _Harvey P. Dale_, Sep 03 2012 *)
%o A010703 (Magma) &cat[ [3, 5]: n in [1..53] ]; // _Klaus Brockhaus_, Dec 10 2009
%o A010703 (PARI) a(n)=3+n%2*2 \\ _Charles R Greathouse IV_, Nov 20 2011
%Y A010703 Cf. A010701 (all 3's sequence), A010716 (all 5's sequence), A084633 (inverse binomial transform of repeated odd numbers), A171497.
%K A010703 nonn,easy
%O A010703 0,1
%A A010703 _N. J. A. Sloane_