The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A086857 a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2. 0
 0, 1, 4, 36, 1681, 2951524, 8721425678436, 76063317347503405466861521, 5785628245908339259107661858418165485688992626641764 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS The next term -- a(9) -- has 104 digits. [Harvey P. Dale, Apr 08 2012] LINKS Table of n, a(n) for n=0..8. MAPLE c[0] := 0:c[1] := 1:for i from 2 to 10 do c[i] := (c[i-1]+c[i-2]+1)^2:od:seq(c[j], j=0..10); # Sascha Kurz MATHEMATICA RecurrenceTable[{a[0]==0, a[1]==1, a[n]==(a[n-1]+a[n-2]+1)^2}, a, {n, 9}] (* Harvey P. Dale, Apr 08 2012 *) CROSSREFS Sequence in context: A173212 A143764 A152287 * A174864 A175493 A179870 Adjacent sequences: A086854 A086855 A086856 * A086858 A086859 A086860 KEYWORD nonn,easy AUTHOR Ernest Brewster (Bill(AT)zlink.net), Sep 15 2003 EXTENSIONS More terms from Ray Chandler, Sep 16 2003 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 21 15:01 EDT 2023. Contains 365502 sequences. (Running on oeis4.)