login
a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2.
0

%I #9 Aug 13 2017 23:25:31

%S 0,1,4,36,1681,2951524,8721425678436,76063317347503405466861521,

%T 5785628245908339259107661858418165485688992626641764

%N a(0) = 0, a(1) = 1; for n > 1, a(n) = (a(n-1) + a(n-2) + 1)^2.

%C The next term -- a(9) -- has 104 digits. [_Harvey P. Dale_, Apr 08 2012]

%p 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_

%t 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 *)

%K nonn,easy

%O 0,3

%A Ernest Brewster (Bill(AT)zlink.net), Sep 15 2003

%E More terms from _Ray Chandler_, Sep 16 2003