|
%I #6 Dec 05 2013 19:56:46
%S 3,4,5,8,8,14,14,18,20,30,30,38,38,42,44,54,54,62,62,68,72,80,80,84,
%T 90,98,102,108,108,114,114,128,132,138,140,152,152,158,164,174,174,
%U 182,182,192,194,200,200,212,224,228,230,240,240,242,252,258,264,272,272,282
%N 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 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 Cf. A092996, A092998, A077154.
%K easy,less,nonn
%O 2,1
%A _Amarnath Murthy_, Mar 29 2004
%E More terms from _David Wasserman_, Aug 22 2006
|
