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!)
 A258595 Number of distinct primes dividing the number of partitions of n into distinct parts, a(n) = A001221(A000009(n)). 2
 0, 0, 0, 1, 1, 1, 1, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 2, 2, 3, 2, 3, 1, 2, 3, 4, 2, 1, 3, 2, 3, 2, 2, 3, 4, 3, 4, 2, 1, 2, 4, 4, 3, 3, 2, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 3, 2, 2, 4, 3, 3, 2, 3, 1, 2, 2, 4, 3, 2, 4, 3, 2, 4, 2, 4, 2, 2, 2, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,9 LINKS Giovanni Resta, Table of n, a(n) for n = 0..10000 FORMULA a(n) = A001221(A000009(n)). MATHEMATICA PrimeNu @ PartitionsQ @ Range[0, 100] CROSSREFS Cf. A000009, A001221, A258594. Sequence in context: A254885 A108461 A321004 * A233544 A026535 A080462 Adjacent sequences: A258592 A258593 A258594 * A258596 A258597 A258598 KEYWORD nonn AUTHOR Giovanni Resta, Jun 04 2015 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 November 27 03:01 EST 2022. Contains 358362 sequences. (Running on oeis4.)