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 A113886 #4 Jun 17 2013 03:07:12
%S A113886 1,1,2,2,4,3,6,3,9,3,6,5,9,7,6,6,12,9,12,6,15,12,12,14,15,12,12,15,16,
%T A113886 13,21,13,18,13,24,12,30,12,33,15,25,18,27,24,30,21,33,18,34,18,42,15,
%U A113886 39,12,42,16,52,15,63
%N A113886 Finite recursive sequence with a(n) = a(a(n-2)) + a(n-a(n-1)).
%F A113886 a(n) = a(a(n-2)) + a(n-a(n-1)), a(0) = a(1) = 1.
%t A113886 a[n_] := a[n] = a[a[n - 2]] + a[n - a[n - 1]] a[0] = a[1] = 1; Table[a[n], {n, 0, 58}]
%K A113886 easy,fini,full,nonn
%O A113886 0,3
%A A113886 Josh Locker (joshlocker(AT)gmail.com), Jan 28 2006