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 A143763 #12 Feb 02 2022 14:37:36
%S A143763 1,0,4,1,9,16,100,8649,74666881,5575141774264384,
%T A143763 31082205803147712138788845611876,
%U A143763 966103517589229313003894215813508352493573272034098666228778225
%N A143763 a(n+1) = (a(n)-n)^2, a(1) = 1.
%C A143763 Let f(n+1,k) = f(n,k)^2 + k*n*f(n,k) + n^2, f(1, k) = 1:
%C A143763 f(n,0)=A143760(n), f(n,-1)=A143761(n), f(n,+1)=A143762(n),
%C A143763 f(n,-2)=a(n), f(n,+2)=A143764(n), f(n,-3)=A143765(n), f(n,+3)=A143766(n).
%H A143763 <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 A143763 a(n) ~ c^(2^n), where c = 1.0360416217849060104872070636721393146594472258894124389077919684140867897... . - _Vaclav Kotesovec_, Dec 18 2014
%t A143763 a=1;Table[a=(n-a)^2,{n,0,16}] (* _Vladimir Joseph Stephan Orlovsky_, Nov 20 2009 *)
%t A143763 RecurrenceTable[{a[n+1] == (a[n]-n)^2, a[1] == 1}, a, {n, 1, 15}] (* _Vaclav Kotesovec_, Dec 18 2014 *)
%t A143763 nxt[{n_,a_}]:={n+1,(a-n)^2}; NestList[nxt,{1,1},12][[All,2]] (* _Harvey P. Dale_, Feb 02 2022 *)
%Y A143763 Cf. A000290.
%K A143763 nonn
%O A143763 1,3
%A A143763 _Reinhard Zumkeller_, Sep 01 2008