We develop a necessary and sufficient primality test for integers N such that N⁶ − 1 is divisible by a large power of 7, based on the properties of two linear recurrence sequences of order 6. These two sequences are analogous to the well-known Lucas sequences. In addition, we provide tables from which it is easy to compute the characteristic polynomial of the sequences.