|
%I #9 Jul 14 2021 17:55:27
%S 14,183,33307,1109322943,1230597390756858307,
%T 1514369938137587813730274566118047943,
%U 2293316309534841541915473293317407057146218304394352680966696226728483307
%N Variant of Sylvester's sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 14
%C The next term (a(8)) has 145 digits. - ~~~
%D Mohammad K. Azarian, Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Problem 958, College Mathematics Journal, Vol. 42, No. 4, September 2011, p. 330. Solution published in Vol. 43, No. 4, September 2012, pp. 340-342
%H Markus Tervooren, <a href="http://factordb.com/search.php?se=28&aq=14&action=all">Factorizations of Silvester/Euclid sequence 14</a>
%t NestList[#^2-#+1&,14,8] (* _Harvey P. Dale_, Jul 14 2021 *)
%Y Cf. A144779, A144780, A144781, A144782, A144783, A144784, A144785
%K nonn
%O 1,1
%A _Ivan Panchenko_, Jun 29 2010
|
