cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

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

Original entry on oeis.org

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

Views

Author

Arkadiusz Wesolowski, Nov 05 2015

Keywords

Links

Crossrefs

Cf. A076336, A257861, A258154.

A289110 a(n) = number of covering sets of modulus 2*n for Sierpiński/Riesel numbers.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 0, 15, 0, 0, 0, 0, 0, 23, 0, 1, 0, 0, 0
Offset: 1

Views

Author

Arkadiusz Wesolowski, Jun 24 2017

Keywords

Comments

a(36) >= 93.
Note that it is not true that a(n) = 0 unless n is a multiple of 6. For example, a(40) = 1.

Links

Crossrefs

Cf. A257647, A258154.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.