Sylvester's sequence: Difference between revisions

m
Remove a bunch of unneeded and unwanted white space
(Added Go)
m (Remove a bunch of unneeded and unwanted white space)
Line 1:
{{draft task}}
{{Wikipedia|Sylvester's sequence}}
 
 
In number theory,   '''Sylvester's sequence'''   is an integer sequence in which each term of the sequence is the product of the previous terms,   plus one.
 
Its values grow doubly exponentially,   and the sum of its reciprocals forms a series of unit fractions that converges to   '''1'''   more rapidly than any other series of unit fractions with the same number of terms.
 
Further, the sum of the first   '''k'''   terms of the infinite series of reciprocals provides the closest possible underestimate of   '''1'''   by any   k-term   Egyptian fraction.
 
 
Line 17:
 
;Related tasks:
:*   [[Egyptian fractions]]
:*   [[Harmonic series]]
 
 
;See also:
:*   [[oeis:A000058|OEIS A000058 - Sylvester's sequence]]
<br><br>
 
=={{header|ALGOL 68}}==
10,333

edits