OFFSET
1,1
COMMENTS
All terms are == 5 (mod 6). - Zak Seidov, Jan 07 2014
There are several interesting computer generated conjectures for this sequence at Jon Maiga's Sequence Machine site. - Antti Karttunen, Dec 07 2021
Note that 5, p, 2p - 5 form an arithmetic progression (PAP-3). - Charles R Greathouse IV, Mar 03 2025
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..25000 (first 1000 terms from Harry J. Smith)
Jon Maiga, Computer-generated formulas for A063909, Sequence Machine.
FORMULA
a(n) = (A145471(n)+5)/2. [Also listed by Sequence Machine, and obviously true] - Antti Karttunen, Dec 07 2021
EXAMPLE
29 is in the sequence since p = 29 is prime and 2*p - 5 = 53 is also prime.
MATHEMATICA
Select[Prime[Range[500]], PrimeQ[2#-5]&] (* Harvey P. Dale, Oct 10 2011 *)
PROG
(PARI) { n=0; p=1; for (m=1, 10^9, p=nextprime(p+1); if (isprime(2*p - 5), write("b063909.txt", n++, " ", p); if (n==1000, break)) ) } \\ Harry J. Smith, Sep 02 2009
(PARI) isA063909(p) = ((p%2)&&isprime(p)&&isprime(p+p-5)); \\ Antti Karttunen, Dec 07 2021
(PARI) list(lim)=my(v=List()); forprimestep(p=5, lim\1, 6, if(isprime(2*p-5), listput(v, p))); Vec(v) \\ Charles R Greathouse IV, Mar 03 2025
(Magma) [p: p in PrimesUpTo(2000) | IsPrime(2*p-5)]; // Vincenzo Librandi, Feb 25 2016
CROSSREFS
KEYWORD
nonn,easy,changed
AUTHOR
N. J. A. Sloane, Aug 31 2001
STATUS
approved