This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A092996 Least k such that 1 < p < n < c < k, where p is a prime and c is a composite number such that for every p there exists a distinct c. 3
 3, 5, 9, 9, 11, 11, 15, 16, 17, 17, 21, 21, 23, 25, 26, 26, 28, 28, 31, 33, 34, 34, 36, 37, 39, 40, 41, 41, 45, 45, 47, 49, 50, 51, 52, 52, 55, 56, 57, 57, 59, 59, 63, 64, 65, 65, 67, 69, 70, 71, 73, 73, 76, 77, 78, 79, 81, 81, 83, 83, 86, 87, 88, 89, 91, 91, 93, 94, 95, 95 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS a(n) is obtained by moving forward beginning with n+1 and counting prime(n) composite numbers, finally adding 1 to the last composite number arising. LINKS EXAMPLE a(6) = 11 as there are three primes 2,3,5, < 6 and there are three composite numbers 8,9,10 between 6 and 11. CROSSREFS Cf. A092997, A092998, A077154. Sequence in context: A230725 A176445 A160173 * A141264 A062949 A166651 Adjacent sequences:  A092993 A092994 A092995 * A092997 A092998 A092999 KEYWORD easy,nonn AUTHOR Amarnath Murthy, Mar 29 2004 EXTENSIONS More terms from Michael Lahm (mpl148(AT)psu.edu), Apr 25 2006 STATUS approved

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

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