id:A086568 - OEIS Search Results

Search: id:A086568

Displaying 1-1 of 1 results found.

page 1

Smallest number having as many distinct prime factors as n has prime factors.

+0
1

1, 2, 2, 6, 2, 6, 2, 30, 6, 6, 2, 30, 2, 6, 6, 210, 2, 30, 2, 30, 6, 6, 2, 210, 6, 6, 30, 30, 2, 30, 2, 2310, 6, 6, 6, 210, 2, 6, 6, 210, 2, 30, 2, 30, 30, 6, 2, 2310, 6, 30, 6, 30, 2, 210, 6, 210, 6, 6, 2, 210, 2, 6, 30, 30030, 6, 30, 2, 30, 6, 30, 2, 2310, 2, 6, 30, 30, 6, 30, 2 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`a(n) = A002110(A001221(n)); A001222(a(n)) = A001221(n);` `a(n)=n iff n=A002110(m) for some m.`
	FORMULA	`a(n) = omega(n)#.`
	CROSSREFS	`Sequence in context: A071796 A121699 A080404 this_sequence A093656 A084426 A138061` `Adjacent sequences: A086565 A086566 A086567 this_sequence A086569 A086570 A086571`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Jan 03 2004`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research