OFFSET
1,2
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4.
EXAMPLE
If n=0, then 2*0 + 7 = 7 (prime).
If n=15, then 2*15 + 7 = 37 (prime).
If n=27, then 2*27 + 7 = 61 (prime).
MATHEMATICA
(Prime[Range[4, 100]]-7)/2 (* Vladimir Joseph Stephan Orlovsky, Feb 08 2010 *)
Select[Range[0, 200], PrimeQ[2 # + 7] &] (* Vincenzo Librandi, May 20 2014 *)
PROG
(Magma)[n: n in [0..200]| IsPrime(2*n+7)]; // Vincenzo Librandi, Dec 21 2010
(PARI) is(n)=isprime(2*n+7) \\ Charles R Greathouse IV, Feb 16 2017
(Sage) [n for n in (0..200) if is_prime(2*n+7) ] # G. C. Greubel, May 21 2019
(GAP) Filtered([0..200], k-> IsPrime(2*k+7) ) # G. C. Greubel, May 21 2019
CROSSREFS
Cf. A153053 (Numbers n such that 2n+7 is not a prime)
Numbers n such that 2n+k is prime: A005097 (k=1), A067076 (k=3), A089038 (k=5), this seq(k=7), A155722 (k=9), A101448 (k=11), A153081 (k=13), A089559 (k=15), A173059 (k=17), A153143 (k=19).
KEYWORD
easy,nonn
AUTHOR
Parthasarathy Nambi, May 04 2005
EXTENSIONS
More terms from Rick L. Shepherd, May 18 2005
STATUS
approved