id:A092997 - OEIS Search Results

Search: id:A092997

Displaying 1-1 of 1 results found.

page 1

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.

+0
4

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; listen)

	OFFSET	`2,1`
	COMMENT	`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 this_sequence A021747 A105020 A112594` `Adjacent sequences: A092994 A092995 A092996 this_sequence 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`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research