id:A143117 - OEIS Search Results

Search: id:A143117

Displaying 1-1 of 1 results found.

page 1

a(n) = the smallest positive integer that divides no more than one integer k, where nth prime <= k <= (n+1)th prime.

+0
2

2, 2, 2, 3, 2, 3, 2, 3, 5, 2, 5, 3, 2, 3, 5, 4, 2, 4, 3, 2, 4, 3, 5, 7, 3, 2, 3, 2, 3, 8, 3, 5, 2, 6, 2, 5, 4, 3, 5, 4, 2, 6, 2, 3, 2, 9, 7, 3, 2, 3, 4, 2, 6, 5, 4, 5, 2, 5, 3, 2, 6, 10, 3, 2, 3, 9, 5, 6, 2, 3, 4, 7, 5, 4, 3, 5, 7, 3, 5, 6, 2, 6, 2, 4, 3, 5, 7, 3, 2, 3, 8, 7, 3, 5, 3, 5, 9, 2, 13, 4, 6, 4, 5, 2, 5 (list; graph; listen)

	OFFSET	`1,1`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	FORMULA	`a(n) = A140715(n) + 1.`
	EXAMPLE	`The 16th prime is 53 and the 17th prime is 59. So we will concern ourselves with the integers 53,54,55,56,57,58,59. 1 divides all these integers. 2 divides three of these integers (54,56,58). 3 divides 54 and 57. 4 divides just 56. So a(16) = 4.`
	CROSSREFS	`Cf. A140715, A143118.` `Sequence in context: A071215 A164024 A145193 this_sequence A076221 A029235 A106696` `Adjacent sequences: A143114 A143115 A143116 this_sequence A143118 A143119 A143120`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Jul 25 2008`
	EXTENSIONS	`Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Nov 10 2008`

page 1

Search completed in 0.002 seconds

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.

AT&T Labs Research