References to A212990

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.
1, 2, 2, 9, 7, 14, 10, 17, 21, 27, 32, 43, 35, 32, 43, 48, 50, 54, 59, 78, 71, 69, 48, 75


1 seqfan posts

Sat Jun 2 22:53:33 CEST 2012    [seqfan] Re: A generalized Gilbreath's conjecture, or "lizard's effect" for primes

Index of A-numbers in seqfan: by ascending order    by month    by frequency    by keyword
Links to OEIS content are included according to The OEIS End-User License Agreement .