login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A179091 Variant of Sylvester's sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 15 1

%I

%S 15,211,44311,1963420411,3855019708367988511,

%T 14861176951905611184725545411860008611,

%U 220854580395850552531842289089175529937535309395681309187277137641134140711

%N Variant of Sylvester's sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 15

%C The next term -- a(8) -- has 149 digits. [From Harvey P. Dale, Mar 14 2012]

%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&amp;aq=15&amp;action=all">Factorizations of Silvester/Euclid sequence 15</a>

%t NestList[#^2-#+1&,15,7] (* _Harvey P. Dale_, Mar 14 2012 *)

%Y Cf. A144779, A144780, A144781, A144782, A144783, A144784, A144785

%K nonn

%O 1,1

%A _Ivan Panchenko_, Jun 29 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 25 19:14 EDT 2020. Contains 337344 sequences. (Running on oeis4.)