login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086568 Smallest number having as many distinct prime factors as n has prime factors. 0
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; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

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: A167268 A187223 A175194 * A160122 A093656 A174028

Adjacent sequences:  A086565 A086566 A086567 * A086569 A086570 A086571

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 03 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 13:08 EST 2012. Contains 205623 sequences.