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 A179091 #20 Sep 01 2025 11:22:30 %S A179091 15,211,44311,1963420411,3855019708367988511, %T A179091 14861176951905611184725545411860008611, %U A179091 220854580395850552531842289089175529937535309395681309187277137641134140711 %N A179091 Variant of Sylvester's sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 15. %C A179091 The next term a(8) has 149 digits. - _Harvey P. Dale_, Mar 14 2012 %D A179091 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 A179091 Markus Tervooren, <a href="http://factordb.com/search.php?se=28&aq=15&action=all">Factorizations of Silvester/Euclid sequence 15</a> %t A179091 NestList[#^2-#+1&,15,7] (* _Harvey P. Dale_, Mar 14 2012 *) %Y A179091 Cf. A144779, A144780, A144781, A144782, A144783, A144784, A144785. %K A179091 nonn,changed %O A179091 1,1 %A A179091 _Ivan Panchenko_, Jun 29 2010