OFFSET
1,1
COMMENTS
These primes stay prime under two iterations of p->2p+3 as well as under two iterations of p->3p+2.
For all entries >5 the least significant digit is 7.
REFERENCES
Joe Buhler: Algorithmic Number Theory: Third International Symposium, ANTS-III, Springer New York, 1998
F. Ischebeck: Einladung zur Zahlentheorie, B. I. Wissenschaftsverlag, Mannheim-Leipzig-Wien-Zuerich, 1992
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
EXAMPLE
2*5 + 3 = 13 = prime(6),
4*5 + 9 = 29 = prime(10),
3*5 + 2 = 17 = prime(7),
9*5 + 8 = 53 = prime(16); 5 = prime(3) = a(1).
MATHEMATICA
Select[Prime[Range[10000]], AllTrue[{2#+3, 4#+9, 3#+2, 9#+8}, PrimeQ]&] (* Harvey P. Dale, Dec 15 2024 *)
PROG
(Magma) [p: p in PrimesUpTo(100000)|IsPrime(2*p+3) and IsPrime(4*p+9) and IsPrime(3*p+2) and IsPrime(9*p+8 )]; // Vincenzo Librandi, Jan 29 2011
CROSSREFS
KEYWORD
nonn
AUTHOR
Ulrich Krug (leuchtfeuer37(AT)gmx.de), Apr 22 2010
STATUS
approved
