More specifically, it usually means a sequence defined by the same recurrence relation as the Fibonacci numbers, but with different initial conditions causing all members of the sequence to be composite numbers that do not all have a common divisor.
To put it algebraically, a sequence of this type is defined by an appropriate choice of two composite numbers a1 and a2, such that the greatest common divisor
there are no primes in the sequence of numbers calculated from the formula The first primefree sequence of this type was published by Ronald Graham in 1964.
A primefree sequence found by Herbert Wilf has initial terms The proof that every term of this sequence is composite relies on the periodicity of Fibonacci-like number sequences modulo the members of a finite set of primes.
, the positions in the sequence where the numbers are divisible by
repeat in a periodic pattern, and different primes in the set have overlapping patterns that result in a covering set for the whole sequence.
The requirement that the initial terms of a primefree sequence be coprime is necessary for the question to be non-trivial.
If the initial terms share a prime factor
both greater than 1), due to the distributive property of multiplication
and more generally all subsequent values in the sequence will be multiples of
In this case, all the numbers in the sequence will be composite, but for a trivial reason.
In Paul Hoffman's biography of Paul Erdős, The man who loved only numbers, the Wilf sequence is cited but with the initial terms switched.