login
a(n)=a(n-1)+a(n-2)^a(n-3); a(1)=a(2)=a(3)=1.
0

%I #6 Aug 27 2019 13:26:10

%S 1,1,1,2,3,5,14,139,537963,1005095210669462420559310863604

%N a(n)=a(n-1)+a(n-2)^a(n-3); a(1)=a(2)=a(3)=1.

%C a(11) has 797 digits and is too large to include.

%F a(n)=a(n-1)+a(n-2)^a(n-3).

%e a(6)=3+2^1=5.

%t RecurrenceTable[{a[1]==a[2]==a[3]==1,a[n]==a[n-1]+a[n-2]^a[n-3]},a,{n,10}] (* _Harvey P. Dale_, Aug 27 2019 *)

%K nonn

%O 1,4

%A Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 25 2009