login
A181674
Number of partitions of n into a primorial and a semiprime.
0
0, 0, 0, 0, 1, 1, 1, 1, 0, 2, 2, 2, 0, 0, 2, 3, 1, 0, 0, 1, 1, 1, 2, 1, 0, 1, 3, 2, 0, 0, 1, 1, 0, 2, 2, 3, 1, 0, 3, 4, 2, 0, 0, 2, 2, 0, 1, 1, 0, 1, 2, 3, 1, 0, 2, 2, 2, 1, 2, 1, 1, 0, 3, 3, 1, 1, 1, 2, 1, 1, 2, 0, 0, 0, 2, 2, 0, 1, 2, 1, 1, 0, 2, 1, 1, 1, 3, 4, 1, 0, 1, 3, 2, 1, 3, 2, 2, 0, 2, 1, 1, 0, 0, 1, 0
OFFSET
1,10
COMMENTS
Number of ways of writing n=k+m where k primorial and m semiprime. The number of decompositions of n into an unordered sum of primorial number and semiprime number.
Conjecture: Average order is Theta(log log n). - Charles R Greathouse IV, May 25 2011
EXAMPLE
a(10)=2 because 10 = 6(primorial)+4(semiprime) = 1(primorial)+9(semiprime).
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved