%I A092997
%S A092997 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,
%T A092997 98,102,108,108,114,114,128,132,138,140,152,152,158,164,174,174,182,182,
%U A092997 192,194,200,200,212,224,228,230,240,240,242,252,258,264,272,272,282
%N 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.
%C A092997 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.
%Y A092997 Cf. A092996, A092998, A077154.
%Y A092997 Sequence in context: A035359 A143593 A028267 this_sequence A021747 A105020 
               A112594
%Y A092997 Adjacent sequences: A092994 A092995 A092996 this_sequence A092998 A092999 
               A093000
%K A092997 easy,less,nonn
%O A092997 2,1
%A A092997 Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Mar 29 2004
%E A092997 More terms from David Wasserman (dwasserm(AT)earthlink.net), Aug 22 2006