The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A289110 a(n) = number of covering sets of modulus 2*n for Sierpiński/Riesel numbers. 0

%I #10 Nov 11 2019 03:54:04

%S 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 0,0

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

%C a(36) >= 93.

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

%H Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/papers/smallbrier.pdf">A search for some small Brier numbers</a>, 2000.

%Y Cf. A257647, A258154.

%K nonn,more

%O 1,18

%A _Arkadiusz Wesolowski_, Jun 24 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 8 17:52 EDT 2024. Contains 373227 sequences. (Running on oeis4.)