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 A071991 #17 Aug 19 2013 03:49:53
%S A071991 1,1,2,3,4,4,5,5,6,7,7,8,9,10,11,11,12,12,13,14,15,16,16,16,17,17,18,
%T A071991 19,20,21,22,23,23,23,23,24,25,25,26,27,28,29,30,31,32,33,34,34,34,34,
%U A071991 35,35,36,36,37,37,38,39,40,41,42,43,44,45,46,47,48,49,49,50,50,50,50
%N A071991 a(1) = a(2) = 1; a(n) = a(floor(n/3)) + a(n - floor(n/3)).
%C A071991 "Rauzy's sequence" with initial values 1, 1.
%C A071991 David Moews showed that a(n)/n converges to about 0.68756. - _Jim Nastos_, Jan 08 2003
%H A071991 David Moews, <a href="http://djm.cc/dmoews/rauzy.pdf">Asymptotic behavior of Rauzy's sequence</a>
%H A071991 Jeffrey Shallit, <a href="http://www.cs.uwaterloo.ca/~shallit/Talks/pmc2.ps">Ten Problems I Can't Solve (1.1 MB ps)</a>
%t A071991 a[1]=a[2]=1; a[n_] := a[n]=a[Floor[n/3]]+a[n-Floor[n/3]]; Table[a[n], {n, 0, 75}]
%Y A071991 a(n) = A071995(n) + A071996(n).
%K A071991 easy,nonn
%O A071991 1,3
%A A071991 _Jim Nastos_, Jun 17 2002
%E A071991 Edited by _N. J. A. Sloane_ and _Robert G. Wilson v_, Jun 23 2002