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

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; internal format)
OFFSET

0,3

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); (from Sascha Kurz)

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 (rayjchandler(AT)sbcglobal.net), Sep 16 2003

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 16 05:39 EST 2012. Contains 205860 sequences.