A076812 a(n) = the smallest prime p such that p-prime(n)*4 is prime.

11, 17, 23, 31, 47, 59, 71, 79, 97, 127, 127, 151, 167, 179, 191, 223, 239, 251, 271, 307, 311, 347, 337, 359, 401, 409, 419, 431, 439, 457, 521, 541, 571, 563, 599, 607, 631, 659, 673, 709, 719, 727, 769, 809, 811, 809, 857, 911, 911, 919, 937, 967, 967

Offset: 1

Author

Cino Hilliard, Nov 19 2002

Keywords

• easy
• nonn

References

• Hans Rademacher, Lectures on Elementary Number Theory, 1964: Primes in an arithmetic progression - Proof of Dirichlet's Theorem. pp. 121-136.

Crossrefs

Cf. A000040, A073703, A073704.

Extensions

Edited by Don Reble, May 03 2006