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 A098152 #24 Sep 08 2022 08:45:14
%S A098152 0,1,3,12,148,21909,480004287,230404115538378376,
%T A098152 53086056457022411804685755744397384,
%U A098152 2818129390158170901506703075470572449397357853477615482257305306043465
%N A098152 a(n) = a(n-1)^2 + n, with a(0)=0.
%H A098152 Indranil Ghosh, <a href="/A098152/b098152.txt">Table of n, a(n) for n = 0..12</a>
%H A098152 Olivier Bodini, Danièle Gardy, Bernhard Gittenberger, Zbigniew Gołębiewski, <a href="http://arxiv.org/abs/1510.01167">On the number of unary-binary tree-like structures with restrictions on the unary height</a>, arXiv:1510.01167 [math.CO], 2015, see Table 1, p. 19.
%H A098152 <a href="/index/Aa#AHSL">Index entries for sequences of form a(n+1)=a(n)^2 + ...</a>
%F A098152 For n>0, a(n) = floor(1.366609561487624975914833969579996...^(2^n)) = floor(A028300(n)^0.68178667449368682115305109818...) = ceiling(A003095(n)^1.53346965582393874689368175542252...).
%e A098152 a(4) = a(3)^2 + 4 =12^2 + 4 = 148.
%t A098152 a=0; lst={}; Do[a=a^2+n; AppendTo[lst, a], {n, 0, 11}]; lst (* _Vladimir Joseph Stephan Orlovsky_, Dec 17 2008 *)
%t A098152 RecurrenceTable[{a[0]==0,a[n]==a[n-1]^2+n},a,{n,10}] (* _Harvey P. Dale_, Jul 28 2012 *)
%o A098152 (Magma) [0] cat [n eq 1 select 1 else Self(n-1)^2+n: n in [1..10]]; // _Vincenzo Librandi_, Oct 06 2015
%Y A098152 Cf. A153058, A153059, A153060, A086851.
%K A098152 nonn
%O A098152 0,3
%A A098152 _Henry Bottomley_, Oct 25 2004