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 A105697 #11 Aug 31 2017 04:19:44
%S A105697 2,2,1,2,2,2,1,2,2,1,2,2,2,1,2,2,2,1,2,2,1,2,2,2,2,1,1,2,2,2,2,1,2,2,
%T A105697 2,2,1,2,2,1,1,2,2,2,2,2,2,1,1,2,2,2,2,2,2,1,1,2,2,2,2,1,1,2,2,2,2,2,
%U A105697 1,1,1,1,1,2,1,1,2,1,1,2,1,1,2,1,1,1,1,2,1,1,2,1,1,2,1,1,2,1,1,1,1,2,1,1,2,1,1,1,1,1
%N A105697 A simple "Fractal Jump Sequence" (FJS).
%C A105697 See A105397 for definition of Fractal Jump Sequence.
%H A105697 Charles R Greathouse IV, <a href="/A105697/b105697.txt">Table of n, a(n) for n = 1..10000</a>
%o A105697 (PARI) first(n)=my(v=apply(k->k+1,binary(255641055942322677663)),i=1,j=1); if(#v<n,v=concat(v,vector(3*n-#v))); while(i<=n, if(v[j]==0,v[j]=v[i]); if(v[i]==0,v[i]=v[j]); if(v[i]==0, v[i]=v[j]=1); if(v[i]!=v[j],error("Failed at step "i", "j", was "v[i]" and needed to be "v[j])); j+=v[j]+1; i++); v[1..n] \\ _Charles R Greathouse IV_, Aug 26 2017
%K A105697 easy,nonn
%O A105697 1,1
%A A105697 _Eric Angelini_, May 04 2005
%E A105697 Partially edited by _N. J. A. Sloane_, Jun 08 2010
%E A105697 Corrected and extended by _Charles R Greathouse IV_, Aug 26 2017