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.
Discussion
Sun Feb 16
08:33
OEIS Server: https://oeis.org/edit/global/3014