id:A117367 - OEIS Search Results

Search: id:A117367

Displaying 1-1 of 1 results found.

page 1

a(n) = smallest prime greater than the smallest prime dividing n.

+0
5

2, 3, 5, 3, 7, 3, 11, 3, 5, 3, 13, 3, 17, 3, 5, 3, 19, 3, 23, 3, 5, 3, 29, 3, 7, 3, 5, 3, 31, 3, 37, 3, 5, 3, 7, 3, 41, 3, 5, 3, 43, 3, 47, 3, 5, 3, 53, 3, 11, 3, 5, 3, 59, 3, 7, 3, 5, 3, 61, 3, 67, 3, 5, 3, 7, 3, 71, 3, 5, 3, 73, 3, 79, 3, 5, 3, 11, 3, 83, 3, 5, 3, 89, 3, 7, 3, 5, 3, 97, 3, 11, 3, 5 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`All even-indexed terms are 3.`
	EXAMPLE	`5 is the smallest prime dividing 35. So a(35) is the smallest prime > 5, which is 7.`
	MAPLE	`with(numtheory): a:=proc(n): if n=1 then 2 else nextprime(factorset(n)[1]) fi: end: seq(a(n), n=1..100); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 22 2006`
	CROSSREFS	`Cf. A117364, A117365, A117366.` `Adjacent sequences: A117364 A117365 A117366 this_sequence A117368 A117369 A117370` `Sequence in context: A103781 A095244 A108396 this_sequence A080184 A052248 A092386`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Mar 10 2006`
	EXTENSIONS	`More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Apr 22 2006`

page 1

Search completed in 0.002 seconds

Last modified October 13 17:46 EDT 2008. Contains 145008 sequences.

AT&T Labs Research