For a prime p, let k(p) be the least k such that 2kp+1 is prime. Sequence gives primes for which k(p) exceeds k(q) for all primes q < p.
A074884
For a prime p, let k(p) be the least k such that 2kp+1 is prime. Sequence gives primes for which k(p) exceeds k(q) for all primes q < p.
Terms
- a(0) =2a(1) =7a(2) =17a(3) =19a(4) =59a(5) =167a(6) =197a(7) =227a(8) =317a(9) =457a(10) =521a(11) =1637a(12) =1861a(13) =1997a(14) =2053a(15) =3833a(16) =5227a(17) =19891a(18) =47303a(19) =54973a(20) =58603a(21) =124567a(22) =138163a(23) =170167a(24) =707467a(25) =1637429a(26) =1940777a(27) =3717731a(28) =4722079a(29) =17886697
External references
- oeis: A074884