|
| |
|
|
A158708
|
|
Primes p such that p + floor(p/2) is prime.
|
|
15
| |
|
|
2, 5, 13, 29, 41, 53, 73, 101, 109, 149, 181, 233, 281, 293, 349, 401, 409, 421, 449, 461, 541, 569, 613, 661, 673, 701, 709, 769, 809, 821, 853, 881, 953, 1021, 1033, 1109, 1129, 1193, 1201, 1249, 1289, 1301, 1409, 1429, 1453, 1481, 1493, 1669, 1693, 1789
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Apart from the first term, primes of the form 4n+1 such that 6n+1 is also prime. [Charles R Greathouse IV, Nov 09 2011]
|
|
|
MATHEMATICA
| lst={}; Do[p=Prime[n]; If[PrimeQ[Floor[p/2]+p], AppendTo[lst, p]], {n, 6!}]; lst
|
|
|
PROG
| (PARI) forprime(p=2, 1e4, if(isprime(p+p\2), print1(p", "))) \\ Charles R Greathouse IV, Nov 09 2011
(PARI) print1(2); forprime(p=3, 1e4, if(p%4==1&&isprime(p\4*6+1), print1(", "p))) \\ Charles R Greathouse IV, Nov 09 2011
|
|
|
CROSSREFS
| Sequence in context: A002559 A049097 A045366 * A093702 A011756 A050950
Adjacent sequences: A158705 A158706 A158707 * A158709 A158710 A158711
|
|
|
KEYWORD
| nonn,easy
|
|
|
AUTHOR
| Vladimir Orlovsky (4vladimir(AT)gmail.com), Mar 24 2009
|
| |
|
|
