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!)
A133449 Least K such that 10^(10*n-1) + K + 6*s are consecutive primes for s=0, s=1, s=2, s=3. 0

%I #6 Mar 31 2012 13:22:05

%S 9561,924591,10306101,40379541,45964621,13860931,97601931,206197461,

%T 39350401,70495851,736139881,120414601,614399751,422650131,862677661,

%U 5344474491,1622536021,502698841,3425985241,806838691,4484608141

%N Least K such that 10^(10*n-1) + K + 6*s are consecutive primes for s=0, s=1, s=2, s=3.

%e 10^9+9561, 10^9+9561+6, 10^9+9561+12, 10^9+9561+18 are consecutive primes so K(1)=9561 (no number < 9561 give 4 consecutive primes).

%K hard,nonn

%O 1,1

%A _Pierre CAMI_, Nov 27 2007

%E a(6)-a(10) corrected and a(11)-a(21) added by _Donovan Johnson_, Nov 11 2008

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)