This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A147579 Numbers with exactly 6 distinct odd prime divisors {3,5,7,11,13,17} 6
 255255, 765765, 1276275, 1786785, 2297295, 2807805, 3318315, 3828825, 4339335, 5360355, 6381375, 6891885, 8423415, 8933925, 9954945, 11486475, 12507495, 13018005, 14039025, 16081065, 16591575, 19144125, 19654635, 20675655 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Successive numbers k such that EulerPhi[x]/x = m ( Family of sequences for successive n odd primes ) m=2/3 numbers with exactly 1 distinct prime divisor {3} see A000244 m=8/15 numbers with exactly 2 distinct prime divisors {3,5} see A033849 m=16/35 numbers with exactly 3 distinct prime divisors {3,5,7} see A147576 m=32/77 numbers with exactly 4 distinct prime divisors {3,5,7,11} see A147577 m=384/1001 numbers with exactly 5 distinct prime divisors {3,5,7,11,13} see A147578 m=6144/17017 numbers with exactly 6 distinct prime divisors {3,5,7,11,13,17} see A147579 m=3072/323323 numbers with exactly 7 distinct prime divisors {3,5,7,11,13,17,19} see A147580 m=110592/323323 numbers with exactly 8 distinct prime divisors {3,5,7,11,13,17,19,23} see A147581 LINKS MATHEMATICA a = {}; Do[If[EulerPhi[255255 x] == 92160 x, AppendTo[a, 255255 x]], {x, 1, 100}]; a(*Artur Jasinski*) CROSSREFS Sequence in context: A140079 A034631 A168352 * A087025 A161534 A052197 Adjacent sequences:  A147576 A147577 A147578 * A147580 A147581 A147582 KEYWORD nonn AUTHOR Artur Jasinski, Nov 07 2008 STATUS approved

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

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