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!)
 A117221 Number of partitions of 3-smooth numbers. 6
 1, 2, 3, 5, 11, 22, 30, 77, 231, 385, 1575, 3010, 8349, 17977, 147273, 386155, 1741630, 5392783, 18004327, 118114304, 483502844, 4351078600, 22540654445, 129913904637, 1987276856363, 15285151248481, 133978259344888, 365749566870782, 3925922161489422, 49005643635237875 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Andrew Howroyd, Table of n, a(n) for n = 1..100 FORMULA a(n) = A000041(A003586(n)). MATHEMATICA PartitionsP /@ Select[Range[1000], AllTrue[FactorInteger[#][[All, 1]], # <= 3 &] &] (* Jean-François Alcover, Oct 13 2021 *) PROG (PARI) \\ here is(n) is test for A003586 inclusion. is(n)={forprime(p=2, 3, n/=p^valuation(n, p)); n==1} seq(n)={my(A=List(), i=0); while(#A

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 05:12 EST 2022. Contains 358362 sequences. (Running on oeis4.)