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

 


A144784
Variant of Sylvester's sequence: a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 11.
17
11, 111, 12211, 149096311, 22229709804712411, 494159998001727075769152612720511, 244194103625066907517263589918036880566782292998362610615987380611
OFFSET
1,1
COMMENTS
For the "exact" formula, compare the Aho-Sloane reference in A000058. - N. J. A. Sloane, Apr 07 2014
LINKS
A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437.
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.
Mohammad K. Azarian, Sylvester's Sequence and the Infinite Egyptian Fraction Decomposition of 1, Solution College Mathematics Journal, Vol. 43, No. 4, September 2012, pp. 340-342.
FORMULA
a(n+1) = a(n)^2 - a(n) + 1, with a(1) = 11.
a(n) ~ c^(2^n) where c = 3.242214... (see A144808).
MATHEMATICA
a = {}; r = 11; Do[AppendTo[a, r]; r = r^2 - r + 1, {n, 1, 10}]; a
CROSSREFS
KEYWORD
nonn
AUTHOR
Artur Jasinski, Sep 21 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 23 18:10 EDT 2024. Contains 376182 sequences. (Running on oeis4.)