A280829 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A280829

Number of partitions of n into two squarefree semiprimes.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,20

LINKS

Indranil Ghosh, Table of n, a(n) for n = 1..1000

Index entries for sequences related to partitions

FORMULA

a(n) = Sum_{i=2..floor(n/2)} A280710(i) * A280710(n-i).

EXAMPLE

a(20) = 2; there are 2 partitions of 20 into two squarefree semiprimes: (14,6) and (10,10).

MAPLE

with(numtheory): A280829:=n->add(floor(bigomega(i)*mobius(i)^2/2)*floor(2*mobius(i)^2/bigomega(i))*floor(bigomega(n-i)*mobius(i)^2/2)*floor(2*mobius(n-i)^2/bigomega(n-i)), i=2..floor(n/2)): seq(A280829(n), n=1..100);

MATHEMATICA

Table[Sum[Floor[PrimeOmega[i] MoebiusMu[i]^2 / 2] Floor[2 MoebiusMu[i]^2 / PrimeOmega[i]] Floor[PrimeOmega[n - i] MoebiusMu[i]^2 / 2] Floor[2 MoebiusMu[n - i]^2 / PrimeOmega[n - i]], {i, 2, Floor[n/2]}], {n, 1, 90}] (* Indranil Ghosh, Mar 10 2017, translated from Maple code *)

PROG

(PARI) for(n=1, 90, print1(sum(i=2, floor(n/2), floor(bigomega(i) * moebius(i)^2 / 2) * floor(2 * moebius(i)^2 / bigomega(i)) * floor(bigomega(n - i) * moebius(i)^2 / 2) * floor(2 * moebius(n - i)^2 / bigomega(n - i))), ", ")) \\ Indranil Ghosh, Mar 10 2017

CROSSREFS

Cf. A006881, A071068, A280710.

Sequence in context: A374444 A304096 A151692 * A303942 A321928 A321917

Adjacent sequences: A280826 A280827 A280828 * A280830 A280831 A280832

KEYWORD

nonn,easy

AUTHOR

Wesley Ivan Hurt, Jan 08 2017

STATUS

approved