Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

A078681

Start with n; iterate the process x -> ceiling(3x/2) until reach a prime. Sequence gives number of steps to reach a prime or 0 if no prime is ever reached.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =53a(4) =5a(5) =52a(6) =1a(7) =4a(8) =51a(9) =2a(10) =1a(11) =3a(12) =39a(13) =50a(14) =1a(15) =162a(16) =3a(17) =2a(18) =1a(19) =38a(20) =49a(21) =4a(22) =2a(23) =161a(24) =50a(25) =2a(26) =1a(27) =52a(28) =4a(29) =37

External references