a(n) = number of partitions of n into semiprimes (more precisely, number of ways of writing n as a sum of products of 2 distinct primes).

A002100

a(n) = number of partitions of n into semiprimes (more precisely, number of ways of writing n as a sum of products of 2 distinct primes).

Terms

    a(0) =0a(1) =0a(2) =0a(3) =0a(4) =0a(5) =1a(6) =0a(7) =0a(8) =0a(9) =1a(10) =0a(11) =1a(12) =0a(13) =1a(14) =1a(15) =1a(16) =0a(17) =1a(18) =0a(19) =2a(20) =2a(21) =2a(22) =0a(23) =2a(24) =1a(25) =3a(26) =2a(27) =3a(28) =1a(29) =4

External references