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.

A361898 A set of 13 primes that form a covering set for a Sierpiński (or Riesel) number.

Original entry on oeis.org

3, 5, 7, 11, 31, 73, 97, 151, 241, 631, 673, 1321, 23311
Offset: 1

Views

Author

Arkadiusz Wesolowski, Mar 28 2023

Keywords

Comments

A set of primes is called the covering set for the Sierpiński number k if for every positive integer m there is at least one prime in the set which divides k*2^m + 1. Similarly, a set of primes is called the covering set for the Riesel number j if for every positive integer m there is at least one prime in the set which divides j*2^m - 1.

Crossrefs