OFFSET
-2,5
COMMENTS
Leading order asymptotics of the sequence is log(a(n))~log(2)*n^3/18.
In general a(n) is a polynomial in q; here evaluated at the value q=2. For q=1 it is the Somos-4 sequence.
REFERENCES
B. Grammaticos, F. Nijhoff and A. Ramani, Discrete Painlevé equations, CRM Series in Mathematical Physics, Ed. R. Conte, Springer-Verlag, New York (1999) 413.
LINKS
Robin Visser, Table of n, a(n) for n = -2..39
S. Fomin and A. Zelevinsky, The Laurent Phenomenon, Advances in Applied Mathematics 28 (2002) 119-144.
A. N. W. Hone, Elliptic curves and quadratic recurrence sequences, Bull. Lond. Math. Soc. 37 (2005) 161-171.
A. N. W. Hone, Algebraic curves, integer sequences and a discrete Painlevé transcendent, arXiv:0807.2538 [nlin.SI], 2008; Proceedings of SIDE 6, Helsinki, Finland, 2004.
FORMULA
a(n) = (2^(n-2)*a(n-1)*a(n-3) + a(n-2)^2)/a(n-4); a(-2)=a(-1)=a(0)=a(1)=1.
0 = a(n+6)*a(n+2)*a(n+1) - 4*a(n+5)*a(n+4)*a(n) + 4*a(n+5)*a(n+2)*a(n+2) - a(n+4)*a(n+4)*a(n+1) for all n in Z. - Michael Somos, Jan 21 2014
0 = a(n+5)*a(n+3)*a(n+1)*a(n+1) - 2*a(n+4)*a(n+4)*a(n+2)*a(n) + 2*a(n+4)*a(n+2)^3 + a(n+3)^3*a(n+1) for all n in Z. - Michael Somos, Jan 21 2014
MAPLE
t[0]:=1; t[1]:=1; t[ -2]:=1; t[ -1]:=1; alpha:=1; beta:=1; for n from 0 to 12 do t[n+2]:=simplify((alpha*2^n*t[n+1]*t[n-1]+beta*t[n]^2)/t[n-2]): od;
MATHEMATICA
nmax = 12; t[-2] = t[-1] = t[0] = t[1] = 1;
Do[t[n+2] = (2^n*t[n+1]*t[n-1] + t[n]^2)/t[n-2], {n, 0, nmax}];
Table[t[n], {n, -2, nmax}] (* Jean-François Alcover, Aug 16 2018, from Maple *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Andrew Hone, Jul 07 2004
EXTENSIONS
More terms from Robin Visser, Aug 20 2023
STATUS
approved