id:A114809 - OEIS Search Results

Search: id:A114809

Displaying 1-1 of 1 results found.

page 1

Smallest abundant number with some prime powers fixed by n.

+0
2

12, 945, 20, 18, 12, 5391411025, 12, 12, 12, 81081, 12, 70, 12, 6435, 56, 24, 12, 5775, 12, 18, 20, 945, 12, 20, 20, 945, 18, 18, 12, 20169691981106018776756331, 12, 48, 20, 945, 12, 30, 12, 945, 20, 12, 12, 366005822969340125, 12, 18, 12, 945 (list; graph; listen)

	OFFSET	`1,1`
	COMMENT	`If n = prod{ p_i^x_i }, a(n) = prod{ p_i^y_i } then we require y_i = x_i - 1 whenever x_i > 0.` `Same as A114371 for squarefree n.` `If k is abundant then k = a(k * prod{ p \| k })`
	EXAMPLE	`12 = 2^2.3^1, so a(12)=70 is the least abundant 2^1.3^0.k with (k,2.3)=1`
	CROSSREFS	`Cf. A005101, A005231, A047802, A114371.` `Sequence in context: A003748 A140412 A116225 this_sequence A114371 A047802 A079916` `Adjacent sequences: A114806 A114807 A114808 this_sequence A114810 A114811 A114812`
	KEYWORD	`nonn`
	AUTHOR	`Hugo van der Sanden (hv(AT)crypt.org), Feb 9 2006`

page 1

Search completed in 0.002 seconds

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.

AT&T Labs Research