login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076812 a(n) = the smallest prime p such that p-prime(n)*4 is prime. 0

%I #9 Oct 19 2017 03:14:07

%S 11,17,23,31,47,59,71,79,97,127,127,151,167,179,191,223,239,251,271,

%T 307,311,347,337,359,401,409,419,431,439,457,521,541,571,563,599,607,

%U 631,659,673,709,719,727,769,809,811,809,857,911,911,919,937,967,967

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

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

%Y Cf. A000040, A073703, A073704.

%K easy,nonn

%O 1,1

%A _Cino Hilliard_, Nov 19 2002

%E Edited by _Don Reble_, May 03 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 9 16:12 EDT 2024. Contains 372353 sequences. (Running on oeis4.)