Smallest number m such that exactly n editing steps (insert or substitute) are necessary to transform the binary representation of m into the least prime not less than m.

A171402

Smallest number m such that exactly n editing steps (insert or substitute) are necessary to transform the binary representation of m into the least prime not less than m.

Terms

    a(0) =2a(1) =0a(2) =8a(3) =14a(4) =63a(5) =62a(6) =252a(7) =254a(8) =766a(9) =2040a(10) =4095a(11) =4094a(12) =12286a(13) =32750a(14) =32764a(15) =65534a(16) =262141a(17) =262140a(18) =1048574a(19) =2097150a(20) =7340030a(21) =8388602a(22) =25165820a(23) =33554428a(24) =67108860a(25) =134217696a(26) =268435420a(27) =268435452a(28) =1073741790a(29) =1073741820

External references