Number of iterations needed to reach 1 when computing repeatedly absolute values of differences of the sequence "2, followed by consecutive primes beginning with the n-th prime". a(n)=0 if 1 is never reached.

We conjecture that a(n)>0, and that after reaching the first 1, all further iterations begin with 1. This is a generalization of the well known Gilbreath's conjecture. We call the effect, that a "tail" of 1's appears after a time, "lizard's effect for primes" (see seqfan list from Jun 01 2012).