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!)
A179121 Variant of Sylvester's sequence: a(n + 1) = a(n)^2 - a(n) + 1, with a(1) = 18 0

%I #7 Jul 17 2013 20:20:03

%S 18,307,93943,8825193307,77884036897092402943,

%T 6065923203387650816975131277148782658307,

%U 36795424309396699379852983331957135547989414580911143782409880284213748733447943

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

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

%Y Cf. A144779, A144780, A144781, A144782, A144783, A144784, A144785, A179090, A179091, A179092, A179093

%K nonn

%O 1,1

%A _Ivan Panchenko_, Jun 30 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 18 17:56 EDT 2024. Contains 371781 sequences. (Running on oeis4.)