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 A153061 #20 Sep 06 2023 09:41:40
%S A153061 4,17,291,84684,7171379860,51428689096413619605,
%T A153061 2644910062175573125355281735337640356031,
%U A153061 6995549236997594095768769895625713364190838574177475661857423797590740438072968
%N A153061 a(-1) = 2, a(n) = a(n-1)^2 + n.
%H A153061 Indranil Ghosh, <a href="/A153061/b153061.txt">Table of n, a(n) for n = 0..10</a>
%H A153061 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A153061 a(n) ~ c^(2^n), where c = 4.1302388785110411646102486678455962713882427692215219090697122047307672779... . - _Vaclav Kotesovec_, Dec 18 2014
%t A153061 a=2;lst={};Do[a=a^2+n;AppendTo[lst,a],{n,0,10}];lst
%t A153061 RecurrenceTable[{a[0]==4,a[n]==a[n-1]^2+n},a,{n,10}] (* _Harvey P. Dale_, Oct 17 2013 *)
%o A153061 (Python)
%o A153061 def aupton(terms):
%o A153061 alst = [4]
%o A153061 for n in range(1, terms): alst.append(alst[-1]**2 + n)
%o A153061 return alst
%o A153061 print(aupton(8)) # _Michael S. Branicky_, Apr 17 2021
%Y A153061 Cf. A153059, A086851, A153060, A098152, A028300.
%K A153061 nonn
%O A153061 0,1
%A A153061 _Vladimir Joseph Stephan Orlovsky_, Dec 17 2008