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!)
A109342 Least k such that (k*M(n))^2+k*M(n)-1 is the first of a pair of twin primes, where M(n) = Mersenne primes. 0

%I

%S 1,3,5,8,89,275,278,404,96,1538,1253,15858,189168,119552,636315,

%T 1047122,3571449

%N Least k such that (k*M(n))^2+k*M(n)-1 is the first of a pair of twin primes, where M(n) = Mersenne primes.

%e (3*M(2))^2+3*M(2)-1 = (3*7)^2+3*7-1 = 461, 461 and 463 twin primes so for n=2 k=3

%Y Cf. A000043.

%K hard,nonn

%O 1,2

%A _Pierre CAMI_, Aug 21 2005; corrected Apr 06 2006

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 October 15 21:38 EDT 2021. Contains 348034 sequences. (Running on oeis4.)