The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A055930 Number of distinct prime factors of totient of (n-th prime)!. 2
 0, 1, 1, 2, 3, 3, 4, 4, 5, 6, 6, 7, 8, 8, 9, 9, 10, 10, 11, 11, 11, 12, 13, 14, 15, 15, 15, 16, 16, 16, 18, 18, 19, 19, 21, 21, 21, 22, 23, 23, 24, 24, 24, 24, 25, 25, 27, 29, 30, 30, 30, 30, 30, 30, 31, 32, 32, 32, 33, 34, 34, 34, 36, 36, 36, 37, 38, 39, 40, 40, 40, 41, 42, 42 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS G. C. Greubel, Table of n, a(n) for n = 1..1000 FORMULA a(n) = A001221(A055929(n)). MATHEMATICA Table[PrimeNu[EulerPhi[Prime[n]!]], {n, 1, 50}] (* G. C. Greubel, May 13 2017 *) PROG (PARI) for(n=1, 50, print1(omega(eulerphi(prime(n)!)) , ", ")) \\ G. C. Greubel, May 13 2017 CROSSREFS Cf. A001221, A039716. Sequence in context: A171975 A160511 A079952 * A090638 A247908 A057363 Adjacent sequences: A055927 A055928 A055929 * A055931 A055932 A055933 KEYWORD nonn AUTHOR Labos Elemer, Jul 17 2000 STATUS approved

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

Last modified December 5 21:40 EST 2022. Contains 358594 sequences. (Running on oeis4.)