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 A010694 #61 Feb 21 2024 10:52:57
%S A010694 2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,
%T A010694 2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,2,4,
%U A010694 2,4,2,4,2,4,2,4,2,4,2,4,2
%N A010694 Period 2: repeat (2,4).
%C A010694 Simple continued fraction expansion of 1 + sqrt(3/2) = A176051. - _R. J. Mathar_, Mar 08 2012
%C A010694 Number of linear characters of dihedral group of order 2(n+1). - _Eric M. Schmidt_, Feb 12 2013
%C A010694 a(n) is the n-th increment between two consecutive elements of the wheel in the wheel factorization with the basis {2, 3}. See A038179. - _Wojciech Raszka_, May 10 2019
%C A010694 In base 3, make a sequence such that after the initial term 2, each term is the sum of the squares of the digits of the previous term. That's this sequence (see A000216 for the base 10 version). - _Alonso del Arte_, Mar 19 2020
%H A010694 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=1073">Encyclopedia of Combinatorial Structures 1073</a>
%H A010694 <a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (0,1).
%F A010694 From _R. J. Mathar_, Aug 28 2008: (Start)
%F A010694 a(n) = 2 * A000034(n).
%F A010694 G.f.: 2(1 + 2x)/((1 - x)(1 + x)). (End)
%F A010694 a(n) = a(n-2) for n >= 2. - _Jaume Oliver Lafont_, Mar 20 2009
%F A010694 a(n) = 2^(n+1) mod 6. - _Roderick MacPhee_, Mar 31 2011
%t A010694 ContinuedFraction[1 + Sqrt[6]/2, 100] (* _Alonso del Arte_, Mar 25 2020 *)
%o A010694 (PARI) a(n)=2*(1+n%2) \\ _Jaume Oliver Lafont_, Mar 20 2009
%o A010694 (Scala) (0 to 99).map(_ % 2 * 2 + 2) // _Alonso del Arte_, Mar 25 2020
%Y A010694 Cf. A000034, A038179, A176051.
%K A010694 nonn,easy
%O A010694 0,1
%A A010694 _N. J. A. Sloane_