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!)
A073881 a(n) = smallest number m (obviously prime) such that pi(m) = 2*pi(n). 0

%I

%S 1,3,7,7,13,13,19,19,19,19,29,29,37,37,37,37,43,43,53,53,53,53,61,61,

%T 61,61,61,61,71,71,79,79,79,79,79,79,89,89,89,89,101,101,107,107,107,

%U 107,113,113,113,113,113,113,131,131,131,131,131,131,139,139,151,151

%N a(n) = smallest number m (obviously prime) such that pi(m) = 2*pi(n).

%K nonn

%O 0,2

%A _Amarnath Murthy_, Aug 16 2002

%E More terms from _Jason Earls_, Aug 22 2002

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 February 5 12:47 EST 2023. Contains 360084 sequences. (Running on oeis4.)