mathematics, a primefree sequence is a sequence of integers that does not contain any prime numbers. More specifically, it usually means a sequence defined by...
5 KB (685 words) - 18:24, 16 January 2023
Covering system (section Primefree sequences)
Davenport and Richard Rado. Covering systems can be used to find primefree sequences, sequences of integers satisfying the same recurrence relation as the Fibonacci...
8 KB (1,225 words) - 15:42, 24 January 2025
= 3, and Ln = Ln−1 + Ln−2. Primefree sequences use the Fibonacci recursion with other starting points to generate sequences in which all numbers are composite...
86 KB (13,066 words) - 15:37, 16 May 2025
Graham scan algorithm for convex hulls. He also began the study of primefree sequences, the Boolean Pythagorean triples problem, the biggest little polygon...
53 KB (4,559 words) - 08:41, 24 May 2025
of composite generalized Fibonacci sequences with first two terms coprime (primefree sequence), such as the sequence starting with 20615674205555510 and...
11 KB (1,076 words) - 07:35, 3 January 2025
The On-Line Encyclopedia of Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A181098 (Primefree centuries (i.e., no prime exists between...
19 KB (2,428 words) - 09:01, 22 May 2025
Integer Sequences. OEIS Foundation. Sloane, N. J. A. (ed.). "Sequence A181098 (Primefree centuries)". The On-Line Encyclopedia of Integer Sequences. OEIS...
29 KB (3,841 words) - 21:13, 25 May 2025