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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A280830 Number of partitions of n into two products-of-three-primes. 1
 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 2, 0, 2, 1, 2, 0, 1, 0, 0, 1, 1, 1, 2, 0, 2, 0, 1, 1, 2, 1, 2, 2, 2, 0, 3, 0, 3, 1, 2, 1, 0, 0, 1, 1, 3, 2, 4, 1, 2, 2, 1, 1, 3, 1, 3, 1, 2, 2, 3, 0, 4, 2, 4, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,36 LINKS Indranil Ghosh, Table of n, a(n) for n = 1..1000 FORMULA a(n) = Sum_{i=2..floor(n/2)} A101605(i) * A101605(n-i). EXAMPLE a(36) = 2; there are 2 partitions of 36 into two products-of-three-primes: (28,8) and (18,18). MAPLE with(numtheory): A280830:=n->add(floor(bigomega(i)/3)*floor(3/bigomega(i))*floor(3/bigomega(n-i))*floor(bigomega(n-i)/3), i=2..floor(n/2)): seq(A280830(n), n=1..100); MATHEMATICA Table[Sum[Floor[PrimeOmega[i]/3] Floor[3/PrimeOmega[i]] Floor[3/PrimeOmega[n - i]] Floor[PrimeOmega[n - i]/3], {i, 2, Floor[n/2]}], {n, 1, 90}] (* Indranil Ghosh, Mar 09 2017, translated from Maple code *) PROG (PARI) for(n=1, 90, print1(sum(i=2, floor(n/2), floor(bigomega(i)/3) * floor(3/bigomega(i)) * floor(3/bigomega(n - i)) * floor(bigomega(n - i)/3)), ", ")) \\ Indranil Ghosh, Mar 09 2017 CROSSREFS Cf. A014612, A101605. Sequence in context: A166348 A294658 A127543 * A068907 A219762 A227696 Adjacent sequences:  A280827 A280828 A280829 * A280831 A280832 A280833 KEYWORD nonn,easy AUTHOR Wesley Ivan Hurt, Jan 08 2017 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.

Last modified August 8 05:25 EDT 2020. Contains 336290 sequences. (Running on oeis4.)