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 A105183 #32 Dec 03 2023 09:12:08
%S A105183 2,7,57,3307,10939557,119673918295807,14321846720271609085072077057,
%T A105183 205115293478954645768397227034180943592279329877217858307,
%U A105183 42072283618957694230389567430137958296609066493047345973782287300661413651741392431587718724877522268597146764557
%N A105183 a(n) = 1 + a(n-1)*(a(n-1) + 1), with a(0)=2.
%C A105183 For n > 1, a(n) has digital root 3 or 4 depending on whether n is odd or even.
%C A105183 The 5-adic valuation of a(n)^2 + 1 is n+1. - _William Hu_, Dec 01 2023
%D A105183 T. Koshy, "Intriguing Properties Of Three Related Number Sequences", in Journal of Recreational Mathematics, vol. 32(3) 210-3 2003-4 Baywood NY.
%F A105183 From _Gerald McGarvey_, Dec 12 2007: (Start)
%F A105183 For n > 0, a(n) = Sum_{k=0..n-1} a(k)^2 + n + 2.
%F A105183 Conjecture: a(n) is asymptotic to d - 1/2 -(5/2^3)/d -(65/2^7)/d^3 -(650/2^11)/d^5 -(19045/2^15)/d^7 -(274950/2^19)/d^9 -(6979050/2^23)/d^11 -(130292500/2^27)/d^13 ... where d = c^(2^n) and c is a constant = 1.288203192684485177845610784851700404829443712770079185959554466777577486352420255603915828361833141546.... (End)
%p A105183 a[0]:=2: for n from 1 to 8 do a[n]:=1+a[n-1]*(a[n-1]+1) od: seq(a[n],n=0..8); # _Emeric Deutsch_, Jun 13 2005
%t A105183 NestList[1+#(#+1)&,2,10] (* _Harvey P. Dale_, Mar 30 2016 *)
%Y A105183 Cf. A005267.
%K A105183 nonn
%O A105183 0,1
%A A105183 _Lekraj Beedassy_, Apr 11 2005
%E A105183 More terms from _Emeric Deutsch_, Jun 13 2005