Minimal number of 1's that must be inserted into the binary representation of n to get a prime.

A091991

Minimal number of 1's that must be inserted into the binary representation of n to get a prime.

Terms

    a(0) =1a(1) =0a(2) =0a(3) =2a(4) =0a(5) =1a(6) =0a(7) =1a(8) =1a(9) =2a(10) =0a(11) =2a(12) =0a(13) =1a(14) =1a(15) =2a(16) =0a(17) =1a(18) =0a(19) =1a(20) =1a(21) =2a(22) =0a(23) =2a(24) =1a(25) =1a(26) =1a(27) =4a(28) =0a(29) =1

External references