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, 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

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.

Links

Table of n, a(n) for n=2..61.

Crossrefs

Cf. A092996, A092998, A077154.

Sequence in context: A028267 A364063 A215497 * A021747 A334631 A105020

Adjacent sequences: A092994 A092995 A092996 * A092998 A092999 A093000

Keyword

easy,less,nonn

Author

Amarnath Murthy, Mar 29 2004

Extensions

More terms from David Wasserman, Aug 22 2006

Status

approved