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 A208224 #11 Mar 19 2017 10:39:19
%S A208224 1,1,1,1,2,5,27,5837,2129410576,17850077316687753782569,
%T A208224 2346851008195218976646246398770505953580095510848345967
%N A208224 a(n)=(a(n-1)^2*a(n-3)^3+a(n-2))/a(n-4) with a(0)=a(1)=a(2)=a(3)=1.
%C A208224 This is the case a=3, b=1, c=2, y(0)=y(1)=y(2)=y(3)=1 of the recurrence shown in the Example 3.3 of "The Laurent phenomenon" (see Link lines, p. 10).
%C A208224 The next term (a(11)) has 133 digits. - _Harvey P. Dale_, Mar 06 2017
%H A208224 Seiichi Manyama, <a href="/A208224/b208224.txt">Table of n, a(n) for n = 0..13</a>
%H A208224 Sergey Fomin and Andrei Zelevinsky, <a href="http://arxiv.org/abs/math/0104241">The Laurent phenomenon</a>, arXiv:math/0104241v1 [math.CO] (2001), Advances in Applied Mathematics 28 (2002), 119-144.
%p A208224 y:=proc(n) if n<4 then return 1: fi: return (y(n-1)^2*y(n-3)^3+y(n-2))/y(n-4): end:
%p A208224 seq(y(n),n=0..11);
%t A208224 RecurrenceTable[{a[0]==a[1]==a[2]==a[3]==1,a[n]==(a[n-1]^2*a[n-3]^3+ a[n-2])/ a[n-4]},a,{n,10}] (* _Harvey P. Dale_, Mar 06 2017 *)
%Y A208224 Cf. A048736, A208221, A208223, A208225, A208227.
%K A208224 nonn
%O A208224 0,5
%A A208224 _Matthew C. Russell_, Apr 25 2012