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.

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

This page as a plain text file.
%I A258154 #12 Nov 22 2015 15:14:03
%S A258154 0,0,0,0,0,0,0,0,0,0,0,509203,0,0,0,0,0,777149,0,0,0,0,0,10157893,0,0,
%T A258154 0,0,0,60014203,0,200883553191612793,0,0,0,7106977,0,0,0
%N A258154 Least k such that k*2^m - 1 has a covering set of modulus 2*n, or 0 if no such value exists.
%H A258154 Wikipedia, <a href="http://en.wikipedia.org/wiki/Riesel_number">Riesel number</a>
%Y A258154 Cf. A101036, A257647, A257861.
%K A258154 nonn
%O A258154 1,12
%A A258154 _Arkadiusz Wesolowski_, Nov 05 2015