id:A070229 - OEIS Search Results

Search: id:A070229

Displaying 1-1 of 1 results found.

page 1

Next m>n such that m is divisible by lpf(n), lpf=A006530 largest prime factor.

+0
1

2, 4, 6, 6, 10, 9, 14, 10, 12, 15, 22, 15, 26, 21, 20, 18, 34, 21, 38, 25, 28, 33, 46, 27, 30, 39, 30, 35, 58, 35, 62, 34, 44, 51, 42, 39, 74, 57, 52, 45, 82, 49, 86, 55, 50, 69, 94, 51, 56, 55, 68, 65, 106, 57, 66, 63, 76, 87, 118, 65, 122 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=(n/lpf(n)+1)lpf(n).` `a(n) = n+lpf(n) where lpf=A006530 largest prime factor. For example, a(14)=14+7=21 (instead of ((14/7)+1))7) - Philippe Lallouet (philip.lallouet(AT)wanadoo.fr), Jun 14 2007`
	CROSSREFS	`Sequence in context: A056942 A115947 A061228 this_sequence A053568 A037225 A060685` `Adjacent sequences: A070226 A070227 A070228 this_sequence A070230 A070231 A070232`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), May 07 2002`

page 1

Search completed in 0.003 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research