This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A143764 #17 Aug 16 2024 15:38:12
%S A143764 1,4,36,1521,2325625,5408554896900,29252466072845872288372836,
%T A143764 855706771342998810018458679815602502067088579902649,
%U A143764 732234078522259249473123638277942895348884466303559008943210424176413224873174808848983192723595659649
%N A143764 a(n+1) = (a(n)+n)^2, a(1) = 1.
%C A143764 Let f(n+1,k) = f(n,k)^2 + k*n*f(n,k) + n^2, f(1, k) = 1:
%C A143764 f(n,0)=A143760(n), f(n,-1)=A143761(n), f(n,+1)=A143762(n),
%C A143764 f(n,-2)=A143763(n), f(n,+2)=a(n), f(n,-3)=A143765(n), f(n,+3)=A143766(n).
%H A143764 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a> [_Reinhard Zumkeller_, Sep 11 2008]
%F A143764 a(n) ~ c^(2^n), where c = 1.581081999938782403516250856478461283288009405562783587423785805068844988... . - _Vaclav Kotesovec_, Dec 18 2014
%t A143764 s=1;lst={};Do[AppendTo[lst,s*=s+=n],{n,0,9}];lst (* _Vladimir Joseph Stephan Orlovsky_, Oct 20 2009 *)
%t A143764 RecurrenceTable[{a[n+1] == (a[n]+n)^2, a[1] == 1}, a, {n, 1, 10}] (* _Vaclav Kotesovec_, Dec 18 2014 *)
%t A143764 FoldList[(#1+#2)^2&,1,Range@8] (* _Ivan N. Ianakiev_, May 08 2015 *)
%t A143764 nxt[{n_,a_}]:={n+1,(a+n)^2}; NestList[nxt,{1,1},10][[;;,2]] (* _Harvey P. Dale_, Aug 16 2024 *)
%Y A143764 Subsequence of A000290.
%K A143764 nonn
%O A143764 1,2
%A A143764 _Reinhard Zumkeller_, Sep 01 2008