|
Search: id:A086857
|
|
|
| A086857 |
|
a(0) = 0, a(1) = 1; for n >1, a(n)=(a(n-1)+a(n-2)+1)^2 |
|
+0
1
|
|
| 0, 1, 4, 36, 1681, 2951524, 8721425678436, 76063317347503405466861521, 5785628245908339259107661858418165485688992626641764
(list; graph; listen)
|
|
|
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: A120605 A143764 A152287 this_sequence A001152 A061024 A103369
Adjacent sequences: A086854 A086855 A086856 this_sequence 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
|
|
|
Search completed in 0.002 seconds
|
