cp's OEIS Frontend

The value of the continued fraction up to n is: R(n) = A(n)/B(n) where B(0) = 1, B(1) = a(1) *B(0), B(n) = a(n)* B(n - 1) + B(n-2) (n>=2).

From theory related to the continued fractions, we have:

- the continued fraction is a simple continued fraction (i.e., generated by integer positive numbers);

- the limit C0 (for n to infinity) exists, it is greater than 1 and is R(n) = A(n)/B(n) = C0 = 1.71010202343009...;

- the limit C0 is an irrational number;

- there is a unique simple continued fraction with limit C0;

- the generating number sequences of the simple continued fraction with limit C0 is unique;

- the sequence of generating numbers of the continued fraction (i.e., the difference of consecutive prime numbers and, consequently, the prime numbers) can be evaluated from C0 by:

a(0) = floor(C0), C1 = 1/(C0-a(0)), a(1) = floor(C1), C2 = 1/(C1-a(1)), ... a(n) = floor(Cn) ...;

- C0 satisfies the inequality: A(n)/B(n) - 1/B(n)^2 < C0 < A(n)/B(n) + 1/B(n)^2;

- this inequality allows us to evaluate the range of a(n+1), given A(n) and B(n);

- knowledge of A(n)/B(n) allows us to evaluate a(0), a(1) ..., a(n), i.e., the difference of consecutive prime numbers and, consequently, the prime numbers.

- The continued fraction derived from the sequences of consecutive prime number differences performs lower gradient w.r.t. the continued fraction based on prime sequence and it is therefore computationally easier to use.

The denominators B(n) are in A109140. Related sequences are D(n) = A(n) - B(n), S(n) = A(n) + B(n).