login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

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. A258594, A000009.

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 30 22:59 EST 2021. Contains 349426 sequences. (Running on oeis4.)