A094699 Number of prime partition numbers <= n-th partition number.

0, 0, 1, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8

Offset: 0

Author

Reinhard Zumkeller, May 20 2004

Keywords

• nonn

Links

• Amiram Eldar, Table of n, a(n) for n = 0..10000

Crossrefs

Cf. A000041, A000720, A046063, A049575, A094700.

Programs

Mathematica

Accumulate[Boole[PrimeQ[Table[PartitionsP[n], {n, 0, 100}]]]] (* Amiram Eldar, May 15 2025 *)

PARI

a(n)=sum(i=1,n,ispseudoprime(numbpart(i))) \\ Charles R Greathouse IV, May 28 2015

Extensions

Offset corrected by Amiram Eldar, May 15 2025