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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172366 Number of partitions of prime(n) into the sum of two semiprimes. 1

%I #15 Dec 21 2015 18:04:25

%S 0,0,0,0,0,1,0,2,1,2,3,2,2,4,4,3,5,6,4,6,5,5,7,4,7,6,7,7,5,5,8,8,8,8,

%T 9,10,9,7,13,10,10,11,13,10,10,10,11,15,18,13,10,13,14,16,12,18,12,15,

%U 12,11

%N Number of partitions of prime(n) into the sum of two semiprimes.

%H Harvey P. Dale, <a href="/A172366/b172366.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) = A072931(A000040(n)).

%e a(8)=2 because prime(8)=19=4(semiprime)+15(semiprime)=9(semiprime)+10(semiprime).

%t Table[Total[If[PrimeOmega[#]=={2,2},1,0]&/@Table[{x-n,n},{n,x/2}]],{x, Prime[ Range[60]]}] (* _Harvey P. Dale_, Dec 21 2015 *)

%Y Cf. A129363, A175933,

%K nonn

%O 1,8

%A _Juri-Stepan Gerasimov_, Nov 20 2010

%E Corrected and extended by _D. S. McNeil_, Nov 20 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 10:29 EDT 2024. Contains 371905 sequences. (Running on oeis4.)