[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
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
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
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,18
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
Table of n, a(n) for n=1..35.
Yves Gallot, A search for some small Brier numbers, 2000.
CROSSREFS
Cf. A257647, A258154.
Sequence in context: A133886 A061859 A348250 * A287287 A323519 A333979
Adjacent sequences: A289107 A289108 A289109 * A289111 A289112 A289113
KEYWORD
nonn,more
AUTHOR
Arkadiusz Wesolowski, Jun 24 2017
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 5 04:48 EDT 2024. Contains 376530 sequences.
License Agreements, Terms of Use, Privacy Policy