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 A244893 #12 Aug 25 2015 17:01:28
%S A244893 2,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,
%T A244893 3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,
%U A244893 2,3,3,2,3,3,2,3
%N A244893 a(n) = a(n-a(n-1)) with initial values 2,3,2.
%C A244893 After first term, periodic with period {3,2,3}.
%H A244893 S. W. Golomb, <a href="/A005185/a005185_1.pdf">Discrete chaos: sequences satisfying "strange" recursions</a>, unpublished manuscript, circa 1990 [cached copy, with permission (annotated)]
%H A244893 <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0, 0, 1).
%F A244893 a(n) = A164359(n), n>1. - _R. J. Mathar_, Jul 25 2014
%p A244893 f:=proc(n,o,S) option remember; # o = offset, S = init. terms
%p A244893 L:=nops(S);
%p A244893 if n < 0 then 0
%p A244893 elif n <= o+L-1 then S[n-o+1]
%p A244893 else f(n-f(n-1,o,S),o,S); fi; end;
%p A244893 [seq(f(n,1,[2,3,2]),n=1..100)];
%t A244893 Join[{2},LinearRecurrence[{0, 0, 1},{3, 2, 3},75]] (* _Ray Chandler_, Aug 25 2015 *)
%K A244893 nonn
%O A244893 1,1
%A A244893 _N. J. A. Sloane_, Jul 17 2014