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 A208225 #11 Mar 19 2017 10:39:16
%S A208225 1,1,1,1,2,9,731,3124943137,11123050014071530610530827873034
%N A208225 a(n)=(a(n-1)^3*a(n-3)^3+a(n-2))/a(n-4) with a(0)=a(1)=a(2)=a(3)=1.
%C A208225 This is the case a=3, b=1, c=3, 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).
%H A208225 Seiichi Manyama, <a href="/A208225/b208225.txt">Table of n, a(n) for n = 0..10</a>
%H A208225 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 A208225 y:=proc(n) if n<4 then return 1: fi: return (y(n-1)^3*y(n-3)^3+y(n-2))/y(n-4): end:
%p A208225 seq(y(n),n=0..9);
%t A208225 RecurrenceTable[{a[0]==a[1]==a[2]==a[3]==1,a[n]==(a[n-1]^3 a[n-3]^3+ a[n-2])/ a[n-4]},a,{n,10}] (* _Harvey P. Dale_, Aug 25 2016 *)
%Y A208225 Cf. A048736, A208222, A208224, A208228.
%K A208225 nonn
%O A208225 0,5
%A A208225 _Matthew C. Russell_, Apr 25 2012