A138479

[Don Reble]

>>%I A138479
>>%S A138479 3,3,5,3,3,5,3,5,5,3,3,7
>>%N A138479 a(n) = smallest prime p such that 2*n+p^2 is another prime, or
>>0 if no such prime exists.

> I did'nt find any solution for n=13 for any 2*n+p^2 less than 10^6, which 
> explains my conjecture.

    Well, don't burn out your CPUs on this one.
    For any prime p except p=3, p^2 == 1 mod 3;
    so p^2+26 is divisible by 3.

-- 
Don Reble  djr at nk.ca


-- 
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.



X-NetKnow-OutGoing-4685-1-MailScanner-Watermark: 1206992389.11476 at 8ZW5p5Qhg7CxD3VxNuk9qw