|
%I #4 Mar 30 2012 18:52:44
%S 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,3,0,1,1,1,1,2,
%T 2,2,1,1,3,3,2,0,0,1,2,1,1,1,1,2,1,2,1,0,1,1,3,2,3,1,1,1,3,2,0,1,1,1,
%U 0,2,2,0,1,0,3,1,0,1,2,1,1,1,2,1,0,2,2,3,2,0,1,2,3,1,2,2,2,1,1,1,2,0,0,0,0
%N Number of ways of writing n = m + f! with m a semiprime and f > 0.
%C Number of partitions of n into a semiprime and a factorial.
%F a(16)=3 because 16 = 2*5 + 3! = 2*7 + 2! = 3*5 + 1!.
%Y Cf. A000142, A001358, A175940.
%K nonn
%O 1,10
%A _Juri-Stepan Gerasimov_, Nov 04 2010
|
