login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A177331 Prime numbers p such that (p*2^k-1)/3 is composite for all even k or all odd k. 2
557, 743, 919, 1163, 3257, 3301, 4817, 5209, 5581, 6323, 6421, 6983, 7457, 7793 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

This sequence consists of the primes >3 for which A177330 is zero. k is even when p=1 (mod 6); k is odd when p=5 (mod 6). This problem is similar to that of finding Sierpinski and Riesel numbers (see A076336 and A076337). Compositeness of (p*2^k-1)/3 for all even or all odd k is established by finding a finite set of primes such that at least one member of the set divides each term. For p <= 7797, the set of primes is {3,5,7,13}.

LINKS

Table of n, a(n) for n=1..14.

CROSSREFS

Sequence in context: A104809 A233728 A233355 * A289564 A319061 A260066

Adjacent sequences:  A177328 A177329 A177330 * A177332 A177333 A177334

KEYWORD

nonn

AUTHOR

T. D. Noe, May 08 2010

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 3 14:34 EDT 2020. Contains 333197 sequences. (Running on oeis4.)