cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A087175 Number of distinct primes dividing the n-th partition number.

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 2, 2, 3, 3, 2, 2, 1, 2, 2, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 3, 4, 4, 4, 3, 3, 3, 3, 4, 4, 3, 3, 3, 3, 5, 3, 5, 4, 3, 3, 4, 5, 3, 5, 4, 3, 5, 2, 4, 2, 4, 3, 4, 3, 3, 3, 4, 6, 2, 1, 4, 4, 4, 2, 4, 3, 5, 2, 5, 2, 4, 3, 2, 3, 2, 2, 6, 2, 4, 7, 3, 2, 5, 3, 3
Offset: 1

Views

Author

Reinhard Zumkeller, Aug 23 2003

Keywords

Examples

			A000041(14) = 135 = 3^3 * 5, so a(14) = 2.
A000041(97) = 133230930 = 2*3*5*7*29*131*167, so a(97)=7.
		

Crossrefs

Programs

  • Mathematica
    Table[If[n==1,0,Length[FactorInteger[PartitionsP[n]]]],{n,1,100}] (* Jonathan Sondow, Aug 19 2011 *)
  • PARI
    a(n)={omega(numbpart(n))} \\ Andrew Howroyd, Dec 28 2017

Formula

a(n) = A001221(A000041(n)).