id:A074767 - OEIS Search Results

Search: id:A074767

Displaying 1-1 of 1 results found.

page 1

Least m>n with spf(m)=gpf(n), where gpf(n) is the greatest prime factor of n and spf(m) is the smallest prime factor of m.

+0
1

1, 4, 9, 6, 25, 9, 49, 10, 15, 25, 121, 15, 169, 49, 25, 18, 289, 21, 361, 25, 49, 121, 529, 27, 35, 169, 33, 49, 841, 35, 961, 34, 121, 289, 49, 39, 1369, 361, 169, 55, 1681, 49, 1849, 121, 55, 529, 2209, 51, 77, 55, 289, 169, 2809, 57, 121, 77, 361, 841, 3481, 65 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n)=gpf(n)^2 for n<gpf(n)^2; and for sqrt(n)-smooth numbers: a(n) <= gpf(n)*(least prime > n/gpf(n)).`
	CROSSREFS	`Cf. A006530, A020639, A064052, A048098, A007918.` `Sequence in context: A061207 A140694 A152454 this_sequence A016097 A083717 A130041` `Adjacent sequences: A074764 A074765 A074766 this_sequence A074768 A074769 A074770`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Sep 29 2002`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research