id:A163620 - OEIS Search Results

Search: id:A163620

Displaying 1-1 of 1 results found.

page 1

Let q(p) be the smallest prime greater than the prime p. a(n) is the smallest integer > n that is divisible by each q(p) for all primes p dividing n.

+0
1

3, 5, 6, 7, 15, 11, 9, 10, 21, 13, 15, 17, 33, 35, 18, 19, 30, 23, 21, 55, 39, 29, 30, 28, 51, 30, 33, 31, 105, 37, 33, 65, 57, 77, 45, 41, 69, 85, 42, 43, 165, 47, 78, 70, 87, 53, 60, 55, 63, 95, 102, 59, 60, 91, 66, 115, 93, 61, 105, 67, 111, 110, 66, 119, 195, 71, 114, 145 (list; graph; listen)

	OFFSET	`2,1`
	EXAMPLE	`18 is divisible by 2 and 3. q(2) = 3, and q(3) = 5. So, a(18) is the smallest integer > 18 that is divisible by both 3 and 5. Therefore a(18) = 30.`
	CROSSREFS	`Sequence in context: A086188 A154535 A006754 this_sequence A072134 A145736 A021741` `Adjacent sequences: A163617 A163618 A163619 this_sequence A163621 A163622 A163623`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Aug 01 2009`
	EXTENSIONS	`Correct second term and extend sequence Sean A. Irvine (sairvin(AT)xtra.co.nz), Sep 06 2009`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research