# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a144781
Showing 1-1 of 1

%I A144781 #17 Sep 02 2020 14:42:58
%S A144781 8,57,3193,10192057,103878015699193,10790642145601683494645152057,
%T A144781 116437957914435303575899742229333045108448631998006179193,
%U A144781 13557798043283806950297045269968250387897834581711367551819275131055206893868524458302302046950954641412419952057
%N A144781 Variant of Sylvester's sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 8.
%H A144781 Mohammad K. Azarian, <a href="http://www.jstor.org/stable/10.4169/college.math.j.42.4.329">Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Problem 958</a>, College Mathematics Journal, Vol. 42, No. 4, September 2011, p. 330.
%H A144781 Mohammad K. Azarian, <a href="http://www.jstor.org/stable/10.4169/college.math.j.43.4.337">Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Solution</a> College Mathematics Journal, Vol. 43, No. 4, September 2012, pp. 340-342.
%F A144781 a(n) ~ c^(2^n) where is c is 2.74167747444233776776... (A144805).
%t A144781 a = {}; k = 8; Do[AppendTo[a, k]; k = k^2 - k + 1, {n, 1, 10}]; a
%t A144781 NestList[#^2-#+1&,8,10] (* _Harvey P. Dale_, Jan 29 2017 *)
%Y A144781 Cf. A000058, A082732, A144805.
%K A144781 nonn
%O A144781 1,1
%A A144781 _Artur Jasinski_, Sep 21 2008

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE