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.
%I A289110 #10 Nov 11 2019 03:54:04 %S A289110 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, %T A289110 0,0 %N A289110 a(n) = number of covering sets of modulus 2*n for Sierpiński/Riesel numbers. %C A289110 a(36) >= 93. %C A289110 Note that it is not true that a(n) = 0 unless n is a multiple of 6. For example, a(40) = 1. %H A289110 Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/papers/smallbrier.pdf">A search for some small Brier numbers</a>, 2000. %Y A289110 Cf. A257647, A258154. %K A289110 nonn,more %O A289110 1,18 %A A289110 _Arkadiusz Wesolowski_, Jun 24 2017