login

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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of partitions of n into parts not less than the smallest prime factor of n.
1

%I #3 Mar 30 2012 18:50:44

%S 1,1,1,2,1,4,1,7,4,12,1,21,1,34,17,55,1,88,1,137,60,210,1,320,30,478,

%T 191,708,1,1039,1,1507,556,2167,150,3094,1,4378,1510,6153,1,8591,1,

%U 11914,3872,16424,1,22519,304,30701,9465,41646,1,56224,2464,75547,22210

%N Number of partitions of n into parts not less than the smallest prime factor of n.

%C a(n) = 1 iff n=1 or n is prime: a(A000040(n)) = 1.

%Y Cf. A020639, A000041, A097359.

%K nonn

%O 1,4

%A _Reinhard Zumkeller_, Aug 09 2004