Least k such that k*2^m + 1 has a covering set of modulus 2*n, or 0 if no such value exists.

Terms

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