%I #10 Sep 12 2018 18:07:44
%S 1,3,19,427,184053,33876427099,1147612313197120118431,
%T 1317014021401644919149757309088631306730827,
%U 1734525932568532421128602190712731410907662021613907396581559184320372648524685950609
%N a(n+1) = a(n)^2 + n*a(n) + n^2, a(1) = 1.
%C Let f(n+1,k) = f(n,k)^2 + k*n*f(n,k) + n^2, f(1, k) = 1:
%C f(n,0)=A143760(n), f(n,-1)=A143761(n), f(n,+1)=a(n),
%C f(n,-2)=A143763(n), f(n,+2)=A143764(n), f(n,-3)=A143765(n),
%C f(n,+3)=A143766(n).
%H <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a> [From _Reinhard Zumkeller_, Sep 11 2008]
%F a(n) ~ c^(2^n), where c = 1.460594463210996899745335217057197049886968082959330102210304982704405107261... . - _Vaclav Kotesovec_, Dec 18 2014
%t RecurrenceTable[{a[n+1] == a[n]^2 + n*a[n] + n^2, a[1] == 1}, a, {n, 1, 10}] (* _Vaclav Kotesovec_, Dec 18 2014 *)
%t nxt[{n_, a_}] := {n + 1, a^2 + n*a + n^2}; NestList[nxt,{1,1},10][[All,2]] (* _Harvey P. Dale_, Sep 12 2018 *)
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Sep 01 2008