login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A092997 Least k such that 1 < c < n < p < k, where p is a prime and c is a composite number such that for every c there exists a distinct p. 3
3, 4, 5, 8, 8, 14, 14, 18, 20, 30, 30, 38, 38, 42, 44, 54, 54, 62, 62, 68, 72, 80, 80, 84, 90, 98, 102, 108, 108, 114, 114, 128, 132, 138, 140, 152, 152, 158, 164, 174, 174, 182, 182, 192, 194, 200, 200, 212, 224, 228, 230, 240, 240, 242, 252, 258, 264, 272, 272, 282 (list; graph; refs; listen; history; internal format)
OFFSET

2,1

COMMENTS

a(n) is obtained by moving forward beginning with n+1 and counting composite(n) prime numbers finally adding 1 to the last prime number arising.

CROSSREFS

Cf. A092996, A092998, A077154.

Sequence in context: A035359 A143593 A028267 * A021747 A105020 A112594

Adjacent sequences:  A092994 A092995 A092996 * A092998 A092999 A093000

KEYWORD

easy,less,nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 29 2004

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Aug 22 2006

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 14 20:38 EST 2012. Contains 205663 sequences.