login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A257647
Least k such that k*2^m + 1 has a covering set of modulus 2*n, or 0 if no such value exists.
3
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 271129, 0, 0, 0, 0, 0, 78557, 0, 0, 0, 0, 0, 327739, 0, 0, 0, 0, 0, 169073869, 0, 201446503145165177, 0, 0, 0, 1777613, 0, 0, 0
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,12
LINKS
Table of n, a(n) for n=1..39.
Chris K. Caldwell,
The Prime Glossary: Sierpinski number
, The Prime Pages.
Wikipedia,
Sierpinski number
CROSSREFS
Cf.
A076336
,
A257861
,
A258154
.
Sequence in context:
A139028
A249254
A075467
*
A206001
A244561
A137715
Adjacent sequences:
A257644
A257645
A257646
*
A257648
A257649
A257650
KEYWORD
nonn
AUTHOR
Arkadiusz Wesolowski
, Nov 05 2015
STATUS
approved
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 July 12 06:08 EDT 2024. Contains 374237 sequences. (Running on oeis4.)