Let c(0)=n>=2 and c(k+1) = floor(3*c(k)/2); then a(n) is the smallest value such that c(a(n)) is prime.
A073538
Let c(0)=n>=2 and c(k+1) = floor(3*c(k)/2); then a(n) is the smallest value such that c(a(n)) is prime.
Terms
- a(0) =0a(1) =0a(2) =3a(3) =0a(4) =2a(5) =0a(6) =12a(7) =1a(8) =5a(9) =0a(10) =11a(11) =0a(12) =2a(13) =4a(14) =6a(15) =0a(16) =10a(17) =0a(18) =3a(19) =1a(20) =3a(21) =0a(22) =5a(23) =1a(24) =93a(25) =9a(26) =5a(27) =0a(28) =2a(29) =0
External references
- oeis: A073538