|
%I #4 Aug 29 2012 14:41:22
%S 1,3,5,31,929,863971,746445024869,557180175152428473492031,
%T 310449747582890872093779269721785644810947012929,
%U 96379045774280656880008037888192772255684941220159788508646084243678677683026025975278640171971
%N Recursive form of A109845 but with a(1)=1.
%C The next term -- a(11) -- has 190 digits. - _Harvey P. Dale_, Aug 29 2012
%F a(1) = 1, a(n)=a(n-1)^2+(-1)^n*a(n-1)+(-1)^n
%p a := proc(n) option remember; if n=1 then 1 else a(n-1)^2+(-1)^n*a(n-1)+(-1)^n fi end:
%t RecurrenceTable[{a[1]==1,a[n]==a[n-1]^2+(-1)^n a[n-1]+(-1)^n},a,{n,10}] (* _Harvey P. Dale_, Aug 29 2012 *)
%Y Cf. A109845.
%K nonn
%O 1,2
%A _Walter Kehowski_, Aug 18 2005
%E More terms from _Harvey P. Dale_, Aug 29 2012
| 