Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095708
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095708 Tau-functions of the q-discrete Painlev\'{e} I equation, f(n+1)=(A*q^n*f(n)+B)/(f(n)^2*f(n-1)), for q=2 and A=B=1, with f(n)=a(n+1)*a(n-1)/a(n)^2. 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. +0
4
1, 1, 1, 1, 2, 5, 24, 409, 16648, 2590589, 2837017232, 14797643031281, 589963307907379136, 330879131533072568115765, 1767380481751546168496112185408 (list; graph; listen)
OFFSET

-2,5

COMMENT

Leading order asymptotics of the sequence is log(a(n))~log(2)*n^3/18.

REFERENCES

S. Fomin and A. Zelevinsky, The Laurent Phenomenon, Advances in Applied Mathematics 28 (2002) 119-144.

B. Grammaticos, F. Nijhoff and A. Ramani, Discrete Painlev\'e equations, CRM Series in Mathematical Physics, Ed. R. Conte, Springer-Verlag, New York (1999) 413

A. N. W. Hone, Elliptic curves and quadratic recurrence sequences, Bulletin of the London Mathematical Society 37 (2005) 161-171.

LINKS

A. N. W. Hone, Algebraic curves, integer sequences and a discrete Painleve transcendent, 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.

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;

CROSSREFS

Cf. A006720.

Sequence in context: A137157 A025134 A076534 this_sequence A120759 A000895 A109306

Adjacent sequences: A095705 A095706 A095707 this_sequence A095709 A095710 A095711

KEYWORD

nonn

AUTHOR

Andrew Hone (anwh(AT)kent.ac.uk), Jul 07 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.


AT&T Labs Research