login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

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

%I #11 May 11 2022 19:16:38

%S 16,241,57841,3345523441,11192527090934957041,

%T 125272662681312932108439098957580518641,

%U 15693240015266013784686188640793618219085803766811358216456462217808967968241

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

%C The next term (a(8)) has 153 digits. - _Harvey P. Dale_, May 11 2022

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

%t NestList[#^2-#+1&,16,6] (* _Harvey P. Dale_, May 11 2022 *)

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 08:45 EDT 2024. Contains 371782 sequences. (Running on oeis4.)