cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A172366 #15 Dec 21 2015 18:04:25
%S A172366 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 A172366 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 A172366 12,11
%N A172366 Number of partitions of prime(n) into the sum of two semiprimes.
%H A172366 Harvey P. Dale, <a href="/A172366/b172366.txt">Table of n, a(n) for n = 1..1000</a>
%F A172366 a(n) = A072931(A000040(n)).
%e A172366 a(8)=2 because prime(8)=19=4(semiprime)+15(semiprime)=9(semiprime)+10(semiprime).
%t A172366 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 A172366 Cf. A129363, A175933,
%K A172366 nonn
%O A172366 1,8
%A A172366 _Juri-Stepan Gerasimov_, Nov 20 2010
%E A172366 Corrected and extended by _D. S. McNeil_, Nov 20 2010