login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A071261 Smallest k such that |p(k)-c(k)| is an n-digit number where p(k) is the k-th prime and c(k) is the k-th composite number. 0

%I

%S 1,10,37,206,1401,10626,85316,712597,6117420,53593619,476889480,

%T 4295913223,39084524707,358521889961,3311439169717,30765562102926,

%U 287282165065268,2694418859703791,25368958219747617

%N Smallest k such that |p(k)-c(k)| is an n-digit number where p(k) is the k-th prime and c(k) is the k-th composite number.

%Y Cf. A038529.

%K hard,more,nonn,base

%O 1,2

%A _Amarnath Murthy_, May 30 2002

%E Corrected and extended by Gabriel Cunningham (gcasey(AT)mit.edu), Apr 08 2003

%E More terms from _Sean A. Irvine_, Nov 30 2009

%E a(12)-a(15) from _Donovan Johnson_, Dec 30 2010

%E a(16)-a(19) from _Chai Wah Wu_, Apr 17 2018

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 16:16 EST 2021. Contains 340270 sequences. (Running on oeis4.)