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 A050062 #10 Sep 08 2015 08:53:50
%S A050062 1,3,2,3,6,7,10,12,15,16,19,21,24,30,37,47,59,60,63,65,68,74,81,91,
%T A050062 103,118,134,153,174,198,228,265,312,313,316,318,321,327,334,344,356,
%U A050062 371,387,406,427,451,481,518
%N A050062 a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p<n-1<=2^(p+1), for n >= 4.
%H A050062 Ivan Neretin, <a href="/A050062/b050062.txt">Table of n, a(n) for n = 1..8193</a>
%t A050062 Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 2}, Flatten@Table[k, {n, 5}, {k, 2^n}]] (* _Ivan Neretin_, Sep 08 2015 *)
%Y A050062 Cf. similar sequences, with different initial conditions, listed in A050034.
%K A050062 nonn
%O A050062 1,2
%A A050062 _Clark Kimberling_