n => 2n+1 to get prime: seed = 73

[זקיר סעידוב - ד\"ר/Zakir Seidov Ph.D.]

OK, Don, thank you very much indeed, and 
A052333 is even more relevant, also see http://www.prothsearch.net/rieselprob.html
WOW, I've rediscovered (once again) the known problem ;-(  Zak 
 
PS Dear Seqfans, do you see all this rubbish in my address?
If so, it's Hebrew letters, and I can't do anything, sorry
 

	From: Don Reble [mailto:djr at nk.ca] 
	Sent: Fri 3/11/2005 3:47 PM 
	Subject: Re: n => 2n+1 to get prime: seed = 73
	> Dear Seqfans,
	> The operation n => 2n+1 quickly gives primes for most "seed" values of n.
	> But for some seeds, the transformed numbers keep being composite.
	> The first "tough" number is n=73.
	> Can the n =>2n+1 transformation, in this particular case,
	>  lead to prime number (and when?),
	
	Starting from 73, the 2552nd number (74 * 2^2552 - 1) is prime. It's a
	771-digit number which begins and ends 12525...16703.
	
	See also A040081.
	Don Reble  djr at nk.ca
	
	

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.seqfan.eu/pipermail/seqfan/attachments/20050311/4c073f17/attachment-0001.htm>