Several number theoretic
and identity properties of three special second order recurring sequences are
established. These are used to develop a necessary and sufficient condition for any
integer of the form 2n3mA− 1(A < 2n+13m− 1) to be prime. This condition can be
easily implemented on a computer.