login
This site is supported by donations 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
9561, 924591, 10306101, 40379541, 45964621, 13860931, 97601931, 206197461, 39350401, 70495851, 736139881, 120414601, 614399751, 422650131, 862677661, 5344474491, 1622536021, 502698841, 3425985241, 806838691, 4484608141 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

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).

CROSSREFS

Sequence in context: A162029 A136476 A136479 * A038825 A038814 A034626

Adjacent sequences:  A133446 A133447 A133448 * A133450 A133451 A133452

KEYWORD

hard,nonn

AUTHOR

Pierre CAMI (pierre-cami(AT)bbox.fr), Nov 27 2007

EXTENSIONS

a(6)-a(10) corrected and a(11)-a(21) added by Donovan Johnson (donovan.johnson(AT)yahoo.com), Nov 11 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 17:11 EST 2012. Contains 205938 sequences.