|
|
A086857
|
|
a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2.
|
|
0
|
|
|
|
OFFSET
|
0,3
|
|
COMMENTS
|
The next term -- a(9) -- has 104 digits. [Harvey P. Dale, Apr 08 2012]
|
|
LINKS
|
|
|
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
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Ernest Brewster (Bill(AT)zlink.net), Sep 15 2003
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|