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.

A118717 Sum of two consecutive semiprimes.

This page as a plain text file.
%I A118717 #11 Mar 18 2017 08:35:20
%S A118717 10,15,19,24,29,36,43,47,51,59,67,69,73,77,85,95,100,106,112,115,120,
%T A118717 127,134,143,151,159,167,171,173,178,184,187,189,201,217,226,233,237,
%U A118717 240,243,245,252,262,267,275,283,285,288,291,301,313,317,320,327,335
%N A118717 Sum of two consecutive semiprimes.
%H A118717 Zak Seidov, <a href="/A118717/b118717.txt">Table of n, a(n) for n = 1..10000</a>
%F A118717 a(n) = A001358(n) + A001358(n+1).
%t A118717 Total /@ Partition[Select[Range[50000], 2 == PrimeOmega[#] &], 2, 1] (* _Zak Seidov_, Jan 31 2017 *)
%o A118717 (PARI) isA001358(n)= { local(f,fct,sumpo); if(n <4, return(0) ); f=factor(n); fct=(matsize(f))[1]; sumpo= sum(i=1,fct,f[i,2]); if ( sumpo != 2, return(0), return(1) ); }
%o A118717 { oldn=0; for(n=4,200, if( isA001358(n)==1, if( oldn !=0, print1(oldn+n,", "); ); oldn=n; ); ); } \\ _R. J. Mathar_, May 23 2006
%Y A118717 Cf. A001358.
%K A118717 nonn
%O A118717 1,1
%A A118717 Luc Stevens (lms022(AT)yahoo.com), May 21 2006
%E A118717 Corrected and extended by _R. J. Mathar_, May 23 2006
%E A118717 Edited by _Ray Chandler_, Oct 31 2010