login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003487 a(n) = a(n-1)^2 - 2.
(Formerly M3926)
3
5, 23, 527, 277727, 77132286527, 5949389624883225721727, 35395236908668169265765137996816180039862527 (list; graph; refs; listen; history; internal format)
OFFSET

0,1

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Index entries for sequences of form a(n+1)=a(n)^2 + ...

FORMULA

a(n) = ceiling(c^(2^n)) where c=(5+sqrt(21))/20 is the largest root of x^2-5x+1=0. - Benoit Cloitre, Dec 03, 2002

a(n) = 2*T(2^n,5/2) where T(n,x) is the Chebyshev polynomial of the first kind. [From Leonid Bedratyuk (leonid.uk(AT)gmail.com), Mar 17 2011]

MAPLE

a:= n-> simplify (2*ChebyshevT(2^n, 1/2*5), 'ChebyshevT'):

seq (a(n), n=0..7);

CROSSREFS

Cf. A001566 (starting with 3), A003010 (starting with 4), A003423 (starting with 6).

Sequence in context: A018899 A080990 A172036 * A055490 A002811 A177134

Adjacent sequences:  A003484 A003485 A003486 * A003488 A003489 A003490

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 14:19 EST 2012. Contains 206038 sequences.