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 A050067 #9 Sep 07 2015 08:16:48
%S A050067 1,3,3,6,12,15,21,36,72,75,81,96,132,207,303,510,1020,1023,1029,1044,
%T A050067 1080,1155,1251,1458,1968,2991,4035,5190,6648,9639,14829,24468,48936,
%U A050067 48939,48945,48960,48996,49071,49167,49374,49884
%N A050067 a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.
%H A050067 Ivan Neretin, <a href="/A050067/b050067.txt">Table of n, a(n) for n = 1..8193</a>
%t A050067 Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 3}, Flatten@Table[2 k, {n, 5}, {k, 2^n}]] (* _Ivan Neretin_, Sep 07 2015 *)
%Y A050067 Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050059, A050063, A050071 (similar, but with different initial conditions).
%K A050067 nonn
%O A050067 1,2
%A A050067 _Clark Kimberling_