<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-2022-jp">
<META content="MSHTML 6.00.2900.2180" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face="MS UI Gothic" size=2>
<DIV><FONT face="MS UI Gothic" size=2> Hello,
Seqfans</FONT></DIV>
<DIV><FONT face="MS UI Gothic" size=2> Once I realized that if
M_n is a Mersenne prime then (M_n+2)/3 is also prime.
2<n<BR> And I knew that it is called "Bateman and Shefridge
and Wagstaff's conjecture ".<BR> Does anyone know the exact
description of it?</FONT></DIV>
<DIV><FONT face="MS UI Gothic" size=2></FONT> </DIV>
<DIV><FONT face="MS UI Gothic" size=2> %I
A000001<BR> %S A000001 3, 11, 43, 2731,
43691<BR> %N A000001 (M_n+2)/3. Where M_n is Mersenne prime
2^n-1.<BR> %C A000001 If "Bateman and Shefridge and Wagstaff's
conjecture " is true, then all terms of the sequence becomes primes.
<BR> %O A000001 3,1
<BR> %Y A000001
A000668<BR> %K A000001
nonn<BR> %A A000001 Yasutoshi Kohmoto (<A
href="">zbi74583@boat.zero.ad.jp</A>)</FONT></DIV>
<DIV> </DIV>
<DIV><FONT face="MS UI Gothic"
size=2><BR></FONT> </DIV></FONT></DIV></BODY></HTML>