Sylvester's sequence

Last updated March 09, 2024

Graphical demonstration of the convergence of the sum 1/2 + 1/3 + 1/7 + 1/43 + ... to 1. Each row of k squares of side length 1/k has total area 1/k, and all the squares together exactly cover a larger square with area 1. Squares with side lengths 1/1807 or smaller are too small to see in the figure and are not shown. Sylvester-square.svg — Graphical demonstration of the convergence of the sum 1/2 + 1/3 + 1/7 + 1/43 + ... to 1. Each row of k squares of side length 1/k has total area 1/k, and all the squares together exactly cover a larger square with area 1. Squares with side lengths 1/1807 or smaller are too small to see in the figure and are not shown.

In number theory, Sylvester's sequence is an integer sequence in which each term is the product of the previous terms, plus one. Its first few terms are

Sylvester's sequence is named after James Joseph Sylvester, who first investigated it in 1880.^[1] 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.^[2] The recurrence by which it is defined allows the numbers in the sequence to be factored more easily than other numbers of the same magnitude,^[3] but, due to the rapid growth of the sequence, complete prime factorizations are known only for a few of its terms.^[4] Values derived from this sequence have also been used to construct finite Egyptian fraction representations of 1, Sasakian Einstein manifolds,^[5] and hard instances for online algorithms.^[6]

Formal definitions

Formally, Sylvester's sequence can be defined by the formula^[7]

s_{n}=1+\prod _{i=0}^{n-1}s_{i}.

The product of the empty set is 1,^[8] so this formula gives s₀ = 2, without need of a separate base case.

Alternatively, one may define the sequence by the recurrence ^[3]

\displaystyle s_{i}=s_{i-1}(s_{i-1}-1)+1,

with the base case s₀ = 2.

It is straightforward to show by induction that this is equivalent to the other definition.

Closed form formula and asymptotics

The Sylvester numbers grow doubly exponentially as a function of n. Specifically, it can be shown that

s_{n}=\left\lfloor E^{2^{n+1}}+{\frac {1}{2}}\right\rfloor ,\!

for a number E that is approximately 1.26408473530530...^[9](sequence A076393 in the OEIS ). This formula has the effect of the following algorithm:

s₀ is the nearest integer to E²; s₁ is the nearest integer to E⁴; s₂ is the nearest integer to E⁸; for s_n, take E², square it n more times, and take the nearest integer.

This would only be a practical algorithm if we had a better way of calculating E to the requisite number of places than calculating s_n and taking its repeated square root.^[10]

The double-exponential growth of the Sylvester sequence is unsurprising if one compares it to the sequence of Fermat numbers F_n; the Fermat numbers are usually defined by a doubly exponential formula, $2^{2^{n}}\!+1$ , but they can also be defined by a product formula very similar to that defining Sylvester's sequence:^[11]

F_{n}=2+\prod _{i=0}^{n-1}F_{i}.

Connection with Egyptian fractions

The unit fractions formed by the reciprocals of the values in Sylvester's sequence generate an infinite series:

\sum _{i=0}^{\infty }{\frac {1}{s_{i}}}={\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{7}}+{\frac {1}{43}}+{\frac {1}{1807}}+\cdots .

The partial sums of this series have a simple form,

\sum _{i=0}^{j-1}{\frac {1}{s_{i}}}=1-{\frac {1}{s_{j}-1}}={\frac {s_{j}-2}{s_{j}-1}}.

This may be proved by induction, or more directly by noting that the recursion implies that

{\frac {1}{s_{i}-1}}-{\frac {1}{s_{i+1}-1}}={\frac {1}{s_{i}}},

so the sum telescopes

\sum _{i=0}^{j-1}{\frac {1}{s_{i}}}=\sum _{i=0}^{j-1}\left({\frac {1}{s_{i}-1}}-{\frac {1}{s_{i+1}-1}}\right)={\frac {1}{s_{0}-1}}-{\frac {1}{s_{j}-1}}=1-{\frac {1}{s_{j}-1}}.

Since this sequence of partial sums (s_j − 2)/(s_j − 1) converges to one, the overall series forms an infinite Egyptian fraction representation of the number one:

1={\frac {1}{2}}+{\frac {1}{3}}+{\frac {1}{7}}+{\frac {1}{43}}+{\frac {1}{1807}}+\cdots .

One can find finite Egyptian fraction representations of one, of any length, by truncating this series and subtracting one from the last denominator:

1={\tfrac {1}{2}}+{\tfrac {1}{3}}+{\tfrac {1}{6}},\quad 1={\tfrac {1}{2}}+{\tfrac {1}{3}}+{\tfrac {1}{7}}+{\tfrac {1}{42}},\quad 1={\tfrac {1}{2}}+{\tfrac {1}{3}}+{\tfrac {1}{7}}+{\tfrac {1}{43}}+{\tfrac {1}{1806}},\quad \dots .

The sum of the first k terms of the infinite series provides the closest possible underestimate of 1 by any k-term Egyptian fraction.^[2] For example, the first four terms add to 1805/1806, and therefore any Egyptian fraction for a number in the open interval (1805/1806, 1) requires at least five terms.

It is possible to interpret the Sylvester sequence as the result of a greedy algorithm for Egyptian fractions, that at each step chooses the smallest possible denominator that makes the partial sum of the series be less than one.^[12] Alternatively, the terms of the sequence after the first can be viewed as the denominators of the odd greedy expansion of 1/2.

Uniqueness of quickly growing series with rational sums

As Sylvester himself observed, Sylvester's sequence seems to be unique in having such quickly growing values, while simultaneously having a series of reciprocals that converges to a rational number. This sequence provides an example showing that double-exponential growth is not enough to cause an integer sequence to be an irrationality sequence.^[13]

To make this more precise, it follows from results of Badea (1993) that, if a sequence of integers $a_{n}$ grows quickly enough that

a_{n}\geq a_{n-1}^{2}-a_{n-1}+1,

and if the series

A=\sum {\frac {1}{a_{i}}}

converges to a rational number A, then, for all n after some point, this sequence must be defined by the same recurrence

a_{n}=a_{n-1}^{2}-a_{n-1}+1

that can be used to define Sylvester's sequence.^[14]

Erdős & Graham (1980) conjectured that, in results of this type, the inequality bounding the growth of the sequence could be replaced by a weaker condition,^[15]

\lim _{n\rightarrow \infty }{\frac {a_{n}}{a_{n-1}^{2}}}=1.

Badea (1995) surveys progress related to this conjecture; see also Brown (1979).^[16]

Divisibility and factorizations

If i < j, it follows from the definition that s_j ≡ 1 (mod s_i ). Therefore, every two numbers in Sylvester's sequence are relatively prime. The sequence can be used to prove that there are infinitely many prime numbers, as any prime can divide at most one number in the sequence. More strongly, no prime factor of a number in the sequence can be congruent to 5 modulo 6, and the sequence can be used to prove that there are infinitely many primes congruent to 7 modulo 12.^[17]

Unsolved problem in mathematics:

Are all the terms in Sylvester's sequence squarefree?

(more unsolved problems in mathematics)

Much remains unknown about the factorization of the numbers in Sylvester's sequence. For instance, it is not known if all numbers in the sequence are squarefree, although all the known terms are.^[18]

As Vardi (1991) describes, it is easy to determine which Sylvester number (if any) a given prime p divides: simply compute the recurrence defining the numbers modulo p until finding either a number that is congruent to zero (mod p) or finding a repeated modulus.^[3] Using this technique he found that 1166 out of the first three million primes are divisors of Sylvester numbers,^[19] and that none of these primes has a square that divides a Sylvester number. The set of primes that can occur as factors of Sylvester numbers is of density zero in the set of all primes:^[20] indeed, the number of such primes less than x is $O(\pi (x)/\log \log \log x)$ .^[21]

The following table shows known factorizations of these numbers (except the first four, which are all prime):^[4]

n	Factors of s_n
4	13 × 139
5	3263443, which is prime
6	547 × 607 × 1033 × 31051
7	29881 × 67003 × 9119521 × 6212157481
8	5295435634831 × 31401519357481261 × 77366930214021991992277
9	181 × 1987 × 112374829138729 × 114152531605972711 × 35874380272246624152764569191134894955972560447869169859142453622851
10	2287 × 2271427 × 21430986826194127130578627950810640891005487 × P156
11	73 × C416
12	2589377038614498251653 × 2872413602289671035947763837 × C785
13	52387 × 5020387 × 5783021473 × 401472621488821859737 × 287001545675964617409598279 × C1600
14	13999 × 74203 × 9638659 × 57218683 × 10861631274478494529 × C3293
15	17881 × 97822786011310111 × 54062008753544850522999875710411 × C6618
16	128551 × C13335
17	635263 × 1286773 × 21269959 × C26661
18	50201023123 × 139263586549 × 60466397701555612333765567 × C53313
19	775608719589345260583891023073879169 × C106685
20	352867 × 6210298470888313 × C213419
21	387347773 × 1620516511 × C426863
22	91798039513 × C853750

As is customary, Pn and Cn denote prime numbers and unfactored composite numbers n digits long.

Applications

Boyer, Galicki & Kollár (2005) use the properties of Sylvester's sequence to define large numbers of Sasakian Einstein manifolds having the differential topology of odd-dimensional spheres or exotic spheres. They show that the number of distinct Sasakian Einstein metrics on a topological sphere of dimension 2n − 1 is at least proportional to s_n and hence has double exponential growth with n.^[5]

As Galambos & Woeginger (1995) describe, Brown (1979) and Liang (1980) used values derived from Sylvester's sequence to construct lower bound examples for online bin packing algorithms.^[6] Seiden & Woeginger (2005) similarly use the sequence to lower bound the performance of a two-dimensional cutting stock algorithm.^[22]

Znám's problem concerns sets of numbers such that each number in the set divides but is not equal to the product of all the other numbers, plus one. Without the inequality requirement, the values in Sylvester's sequence would solve the problem; with that requirement, it has other solutions derived from recurrences similar to the one defining Sylvester's sequence. Solutions to Znám's problem have applications to the classification of surface singularities (Brenton and Hill 1988) and to the theory of nondeterministic finite automata.^[23]

Curtiss (1922) describes an application of the closest approximations to one by k-term sums of unit fractions, in lower-bounding the number of divisors of any perfect number, and Miller (1919) uses the same property to upper bound the size of certain groups.^[24]

Notes

↑ Sylvester (1880).
1 2 This claim is commonly attributed to Curtiss (1922), but Miller (1919) appears to be making the same statement in an earlier paper. See also Rosenman & Underwood (1933), Salzer (1947), Soundararajan (2005), and Nathanson (2023).
1 2 3 Vardi (1991).
1 2 All prime factors p of Sylvester numbers s_n with p< 5×10⁷ and n ≤ 200 are listed by Vardi. Ken Takusagawa lists the factorizations up to s₉ and the factorization of s₁₀. The remaining factorizations are from a list of factorizations of Sylvester's sequence maintained by Jens Kruse Andersen. Retrieved 2014-06-13.
1 2 Boyer, Galicki & Kollár (2005).
1 2 Galambos & Woeginger (1995); Brown (1979); Liang (1980).
↑ Sloane, N. J. A. (ed.). "SequenceA000058(Sylvester's sequence)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
↑ Nešetřil & Matoušek (1998).
↑ Graham, Knuth & Patashnik (1989), formula 4.17, p. 109, and exercise 4.37, p. 147; see also Golomb (1963).
↑ Graham, Knuth & Patashnik (1989), p. 109.
↑ Sloane, N. J. A. (ed.). "SequenceA000215(Fermat numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.
↑ Nathanson (2023).
↑ Guy (2004).
↑ Badea (1993).
↑ Erdős & Graham (1980).
↑ Badea (1995); Brown (1979).
↑ Guy & Nowakowski (1975).
↑ Graham, Knuth & Patashnik (1989), research problem 4.65, p. 151; Vardi (1991); see also Chentouf (2020)
↑ This appears to be a typo, as Andersen finds 1167 prime divisors in this range.
↑ Jones (2006).
↑ Odoni (1985).
↑ In their work, Seiden and Woeginger refer to Sylvester's sequence as "Salzer's sequence" after the work of Salzer (1947) on closest approximation.
↑ Domaratzki et al. (2005).
↑ Curtiss (1922); Miller (1919).

Related Research Articles

In mathematics, the Euclidean algorithm, or Euclid's algorithm, is an efficient method for computing the greatest common divisor (GCD) of two integers (numbers), the largest number that divides them both without a remainder. It is named after the ancient Greek mathematician Euclid, who first described it in his Elements . It is an example of an algorithm, a step-by-step procedure for performing a calculation according to well-defined rules, and is one of the oldest algorithms in common use. It can be used to reduce fractions to their simplest form, and is a part of many other number-theoretic and cryptographic calculations.

In mathematics, the factorial of a non-negative integer $,$ denoted by $,$ is the product of all positive integers less than or equal to $.$ The factorial of also equals the product of $with the next smaller factorial:$

In mathematics, the Fibonacci sequence is a sequence in which each number is the sum of the two preceding ones. Numbers that are part of the Fibonacci sequence are known as Fibonacci numbers, commonly denoted $F n$ . The sequence commonly starts from 0 and 1, although some authors start the sequence from 1 and 1 or sometimes from 1 and 2. Starting from 0 and 1, the sequence begins

In mathematics, an integral domain is a nonzero commutative ring in which the product of any two nonzero elements is nonzero. Integral domains are generalizations of the ring of integers and provide a natural setting for studying divisibility. In an integral domain, every nonzero element a has the cancellation property, that is, if a ≠ 0, an equality ab = ac implies b = c.

<span class="mw-page-title-main">Prime number</span> Number divisible only by 1 or itself

A prime number is a natural number greater than 1 that is not a product of two smaller natural numbers. A natural number greater than 1 that is not prime is called a composite number. For example, 5 is prime because the only ways of writing it as a product, 1 × 5 or 5 × 1, involve 5 itself. However, 4 is composite because it is a product (2 × 2) in which both numbers are smaller than 4. Primes are central in number theory because of the fundamental theorem of arithmetic: every natural number greater than 1 is either a prime itself or can be factorized as a product of primes that is unique up to their order.

In mathematics, a square-free integer (or squarefree integer) is an integer which is divisible by no square number other than 1. That is, its prime factorization has exactly one factor for each prime that appears in it. For example, 10 = 2 ⋅ 5 is square-free, but 18 = 2 ⋅ 3 ⋅ 3 is not, because 18 is divisible by 9 = 3². The smallest positive square-free numbers are

In number theory, given a prime number $p$ , the $p$ -adic numbers form an extension of the rational numbers which is distinct from the real numbers, though with some similar properties; $p$ -adic numbers can be written in a form similar to decimals, but with digits based on a prime number $p$ rather than ten, and extending to the left rather than to the right.

<span class="mw-page-title-main">Euler's totient function</span> Number of integers coprime to and not exceeding n

In number theory, Euler's totient function counts the positive integers up to a given integer $n$ that are relatively prime to $n$ . It is written using the Greek letter phi as $or, and may also be called Euler's phi function . In other words, it is the number of integers k in the range 1 \leq k \leq n for which the greatest common divisor gcd(n, k) is equal to 1. The integers k of this form are sometimes referred to as totatives of n .$

2 (two) is a number, numeral and digit. It is the natural number following 1 and preceding 3. It is the smallest and only even prime number. Because it forms the basis of a duality, it has religious and spiritual significance in many cultures.

In mathematics, the harmonic series is the infinite series formed by summing all positive unit fractions:

In number theory, the study of Diophantine approximation deals with the approximation of real numbers by rational numbers. It is named after Diophantus of Alexandria.

In number theory, an abundant number or excessive number is a positive integer for which the sum of its proper divisors is greater than the number. The integer 12 is the first abundant number. Its proper divisors are 1, 2, 3, 4 and 6 for a total of 16. The amount by which the sum exceeds the number is the abundance. The number 12 has an abundance of 4, for example.

$<span class="mw-page-title-main">Egyptian fraction</span> Finite sum of distinct unit fractions$

An Egyptian fraction is a finite sum of distinct unit fractions, such as

$<span class="mw-page-title-main">Unit fraction</span> One over a whole number$

A unit fraction is a positive fraction with one as its numerator, 1/ $n$ . It is the multiplicative inverse (reciprocal) of the denominator of the fraction, which must be a positive natural number. Examples are 1/1, 1/2, 1/3, 1/4, 1/5, etc. When an object is divided into equal parts, each part is a unit fraction of the whole.

In number theory, a practical number or panarithmic number is a positive integer $such that all smaller positive integers can be represented as sums of distinct divisors of . For example, 12 is a practical number because all the numbers from 1 to 11 can be expressed as sums of its divisors 1, 2, 3, 4, and 6: as well as these divisors themselves, we have 5 = 3 + 2, 7 = 6 + 1, 8 = 6 + 2, 9 = 6 + 3, 10 = 6 + 3 + 1, and 11 = 6 + 3 + 2.$

<span class="mw-page-title-main">Znám's problem</span> On divisibility among sets of integers

In number theory, Znám's problem asks which sets of integers have the property that each integer in the set is a proper divisor of the product of the other integers in the set, plus 1. Znám's problem is named after the Slovak mathematician Štefan Znám, who suggested it in 1972, although other mathematicians had considered similar problems around the same time.

The Erdős–Straus conjecture is an unproven statement in number theory. The conjecture is that, for every integer $that is 2 or more, there exist positive integers,, and for which$

In number theory, a polite number is a positive integer that can be written as the sum of two or more consecutive positive integers. A positive integer which is not polite is called impolite. The impolite numbers are exactly the powers of two, and the polite numbers are the natural numbers that are not powers of two.

<span class="mw-page-title-main">Rational number</span> Quotient of two integers

In mathematics, a rational number is a number that can be expressed as the quotient or fraction of two integers, a numerator $p$ and a non-zero denominator $q$ . For example, is a rational number, as is every integer. The set of all rational numbers, also referred to as "the rationals", the field of rationals or the field of rational numbers is usually denoted by boldface $Q$ , or blackboard bold

References

Badea, Catalin (1993). "A theorem on irrationality of infinite series and applications". Acta Arithmetica . 63 (4): 313–323. doi: 10.4064/aa-63-4-313-323 . MR 1218459.
Badea, Catalin (1995). "On some criteria for irrationality for series of positive rationals: a survey" (PDF). Archived from the original (PDF) on 2008-09-11.
Boyer, Charles P.; Galicki, Krzysztof; Kollár, János (2005). "Einstein metrics on spheres". Annals of Mathematics . 162 (1): 557–580. arXiv: math.DG/0309408 . doi:10.4007/annals.2005.162.557. MR 2178969. S2CID 13945306.
Brenton, Lawrence; Hill, Richard (1988). "On the Diophantine equation 1=Σ1/n_i + 1/Πn_i and a class of homologically trivial complex surface singularities". Pacific Journal of Mathematics . 133 (1): 41–67. doi: 10.2140/pjm.1988.133.41 . MR 0936356.
Brown, D. J. (1979). A lower bound for on-line one-dimensional bin packing algorithms. Tech. Rep. R-864. Coordinated Science Lab., Univ. of Illinois, Urbana-Champaign.
Chentouf, A. Anas (2020). "On Sylvester's Sequence and some of its properties" (PDF). Parabola. 56 (2).
Curtiss, D. R. (1922). "On Kellogg's diophantine problem". American Mathematical Monthly . 29 (10): 380–387. doi:10.2307/2299023. JSTOR 2299023.
Domaratzki, Michael; Ellul, Keith; Shallit, Jeffrey; Wang, Ming-Wei (2005). "Non-uniqueness and radius of cyclic unary NFAs". International Journal of Foundations of Computer Science. 16 (5): 883–896. doi:10.1142/S0129054105003352. MR 2174328.
Erdős, Paul; Graham, Ronald L. (1980). Old and new problems and results in combinatorial number theory. Monographies de L'Enseignement Mathématique, No. 28, Univ. de Genève. MR 0592420.
Galambos, Gábor; Woeginger, Gerhard J. (1995). "On-line bin packing — A restricted survey". Mathematical Methods of Operations Research. 42 (1): 25. doi:10.1007/BF01415672. MR 1346486. S2CID 26692460.
Golomb, Solomon W. (1963). "On certain nonlinear recurring sequences". American Mathematical Monthly. 70 (4): 403–405. doi:10.2307/2311857. JSTOR 2311857. MR 0148605.
Graham, Ronald; Knuth, Donald E.; Patashnik, Oren (1989). Concrete Mathematics (2e ed.). Addison-Wesley. ISBN 978-0-201-55802-9.
Guy, Richard K. (2004). "E24 Irrationality sequences". Unsolved Problems in Number Theory (3rd ed.). Springer-Verlag. p. 346. ISBN 0-387-20860-7. Zbl 1058.11001.
Guy, Richard; Nowakowski, Richard (1975). "Discovering primes with Euclid". Delta (Waukesha). 5 (2): 49–63. MR 0384675.
Jones, Rafe (2006). "The density of prime divisors in the arithmetic dynamics of quadratic polynomials". Journal of the London Mathematical Society. 78 (2): 523–544. arXiv: math.NT/0612415 . Bibcode:2006math.....12415J. doi:10.1112/jlms/jdn034. S2CID 15310955.
Liang, Frank M. (1980). "A lower bound for on-line bin packing". Information Processing Letters. 10 (2): 76–79. doi:10.1016/S0020-0190(80)90077-0. MR 0564503.
Nešetřil, Jaroslav; Matoušek, Jiří (1998). Invitation to Discrete Mathematics. Oxford University Press. p. 12. ISBN 0-19-850207-9.
Miller, G. A. (1919). "Groups possessing a small number of sets of conjugate operators". Transactions of the American Mathematical Society . 20 (3): 260–270. doi: 10.2307/1988867 . JSTOR 1988867.
Nathanson, Melvyn B. (January 2023). "Underapproximation by Egyptian fractions". Journal of Number Theory. 242: 208–234. doi:10.1016/j.jnt.2022.07.005.
Odoni, R. W. K. (1985). "On the prime divisors of the sequence w_n+1 =1+w₁⋯w_n". Journal of the London Mathematical Society. Series II. 32: 1–11. doi:10.1112/jlms/s2-32.1.1. Zbl 0574.10020.
Rosenman, Martin; Underwood, F. (1933). "Problem 3536". American Mathematical Monthly. 40 (3): 180–181. doi:10.2307/2301036. JSTOR 2301036.
Salzer, H. E. (1947). "The approximation of numbers as sums of reciprocals". American Mathematical Monthly. 54 (3): 135–142. doi:10.2307/2305906. JSTOR 2305906. MR 0020339.
Seiden, Steven S.; Woeginger, Gerhard J. (2005). "The two-dimensional cutting stock problem revisited". Mathematical Programming. 102 (3): 519–530. doi:10.1007/s10107-004-0548-1. MR 2136225. S2CID 35815524.
Soundararajan, K. (2005). "Approximating 1 from below using n Egyptian fractions". arXiv: math.CA/0502247 .
Sylvester, J. J. (1880). "On a point in the theory of vulgar fractions". American Journal of Mathematics . 3 (4): 332–335. doi:10.2307/2369261. JSTOR 2369261.
Vardi, Ilan (1991). Computational Recreations in Mathematica. Addison-Wesley. pp. 82–89. ISBN 0-201-52989-0.

External links

Irrationality of Quadratic Sums, from K. S. Brown's MathPages.
Weisstein, Eric W. "Sylvester's Sequence". MathWorld .

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[FOOTNOTESylvester1880-1] Sylvester (1880).

[closest-2] 1 2 This claim is commonly attributed to Curtiss (1922), but Miller (1919) appears to be making the same statement in an earlier paper. See also Rosenman & Underwood (1933), Salzer (1947), Soundararajan (2005), and Nathanson (2023).

[FOOTNOTEVardi1991-3] 1 2 3 Vardi (1991).

[factorizations-4] 1 2 All prime factors p of Sylvester numbers s_n with p< 5×10⁷ and n ≤ 200 are listed by Vardi. Ken Takusagawa lists the factorizations up to s₉ and the factorization of s₁₀. The remaining factorizations are from a list of factorizations of Sylvester's sequence maintained by Jens Kruse Andersen. Retrieved 2014-06-13.

[FOOTNOTEBoyerGalickiKollár2005-5] 1 2 Boyer, Galicki & Kollár (2005).

[FOOTNOTEGalambosWoeginger1995Brown1979Liang1980-6] 1 2 Galambos & Woeginger (1995); Brown (1979); Liang (1980).

[7] Sloane, N. J. A. (ed.). "SequenceA000058(Sylvester's sequence)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.

[FOOTNOTENešetřilMatoušek1998-8] Nešetřil & Matoušek (1998).

[9] Graham, Knuth & Patashnik (1989), formula 4.17, p. 109, and exercise 4.37, p. 147; see also Golomb (1963).

[FOOTNOTEGrahamKnuthPatashnik1989109-10] Graham, Knuth & Patashnik (1989), p. 109.

[11] Sloane, N. J. A. (ed.). "SequenceA000215(Fermat numbers)". The On-Line Encyclopedia of Integer Sequences . OEIS Foundation.

[FOOTNOTENathanson2023-12] Nathanson (2023).

[FOOTNOTEGuy2004-13] Guy (2004).

[FOOTNOTEBadea1993-14] Badea (1993).

[FOOTNOTEErdősGraham1980-15] Erdős & Graham (1980).

[FOOTNOTEBadea1995Brown1979-16] Badea (1995); Brown (1979).

[FOOTNOTEGuyNowakowski1975-17] Guy & Nowakowski (1975).

[18] Graham, Knuth & Patashnik (1989), research problem 4.65, p. 151; Vardi (1991); see also Chentouf (2020)

[19] This appears to be a typo, as Andersen finds 1167 prime divisors in this range.

[FOOTNOTEJones2006-20] Jones (2006).

[FOOTNOTEOdoni1985-21] Odoni (1985).

[22] In their work, Seiden and Woeginger refer to Sylvester's sequence as "Salzer's sequence" after the work of Salzer (1947) on closest approximation.

[FOOTNOTEDomaratzkiEllulShallitWang2005-23] Domaratzki et al. (2005).

[FOOTNOTECurtiss1922Miller1919-24] Curtiss (1922); Miller (1919).

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]

[12]

[13]

[14]

[15]

[16]

[17]

[18]

[19]

[20]

[21]

[22]

[23]

[24]