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 A088435 #13 Aug 12 2017 13:02:49 %S A088435 3,2,2,1,2,3,2,1,3,2,1,2,2,3,2,1,3,2,2,1,2,3,1,2,3,2,1,2,2,3,2,1,3,2, %T A088435 2,1,2,3,2,1,3,2,1,2,2,3,1,2,3,2,2,1,2,3,1,2,3,2,1,2,2,3,2,1,3,2,2,1, %U A088435 2,3,2,1,3,2,1,2,2,3,2,1,3,2,2,1,2,3,1,2,3,2,1,2,2,3,1,2,3,2,2,1,2,3,2,1,3 %N A088435 1/2 + half of the (n+1)-st component of the continued fraction expansion of sum(k>=1,1/3^(2^k)). %C A088435 To construct the sequence use the rule : a(1)=3, then a(a(1)+a(2)+...+a(n)+1)=2+(-1)^n and fill in any undefined place with 2. %H A088435 Antti Karttunen, <a href="/A088435/b088435.txt">Table of n, a(n) for n = 1..8192</a> (computed from the b-file of A004200 provided by _Harry J. Smith_) %F A088435 a(n) = (1/2) * (1+A004200(n+1)). %F A088435 a(a(1)+a(2)+...+a(n)+1) = 2+(-1)^n. %e A088435 Example to illustrate the comment : a(a(1)+1) = a(4) = 2+(-1)^1 = 1 and a(2), a(3) are undefined. The rule forces a(2) = a(3) = 2. %Y A088435 Cf. A088431. %K A088435 nonn %O A088435 1,1 %A A088435 _Benoit Cloitre_, Nov 08 2003