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

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 271129, 0, 0, 0, 0, 0, 78557, 0, 0, 0, 0, 0, 327739, 0, 0, 0, 0, 0, 169073869, 0, 201446503145165177, 0, 0, 0, 1777613, 0, 0, 0

Offset

1,12

Links

Table of n, a(n) for n=1..39.

Chris K. Caldwell, The Prime Glossary: Sierpinski number, The Prime Pages.

Wikipedia, Sierpinski number

Crossrefs

Cf. A076336, A257861, A258154.

Sequence in context: A139028 A249254 A075467 * A206001 A244561 A137715

Adjacent sequences: A257644 A257645 A257646 * A257648 A257649 A257650

Keyword

nonn

Author

Arkadiusz Wesolowski, Nov 05 2015

Status

approved