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.

A112774 Semiprimes of the form 6n+4.

This page as a plain text file.
%I A112774 #21 Sep 08 2022 08:45:23
%S A112774 4,10,22,34,46,58,82,94,106,118,142,166,178,202,214,226,262,274,298,
%T A112774 334,346,358,382,394,454,466,478,502,514,526,538,562,586,622,634,694,
%U A112774 706,718,766,778,802,838,862,886,898,922,934,958,982,1006,1018,1042,1114
%N A112774 Semiprimes of the form 6n+4.
%C A112774 {6} + A112772 + A112774 = A100484 = 2*A000040.
%H A112774 Vincenzo Librandi, <a href="/A112774/b112774.txt">Table of n, a(n) for n = 1..1000</a>
%F A112774 a(n) = 2 * A003627(n) = 6 * A024893(n) + 4.
%t A112774 Select[6 Range[0, 200] + 4, PrimeOmega[#] == 2&] (* _Vincenzo Librandi_, Sep 22 2012 *)
%o A112774 (Magma) IsSemiprime:=func<n | &+[d[2]: d in Factorization(n)] eq 2>; [s: n in [0..200] | IsSemiprime(s) where s is 6*n + 4]; // _Vincenzo Librandi_, Sep 22 2012
%o A112774 (Python)
%o A112774 from sympy import factorint
%o A112774 def semiprime(n): f = factorint(n); return sum(f[p] for p in f) == 2
%o A112774 print(list(filter(semiprime, range(4, 1115, 6)))) # _Michael S. Branicky_, Apr 10 2021
%K A112774 easy,nonn
%O A112774 1,1
%A A112774 _Jonathan Vos Post_ and _Ray Chandler_, Oct 15 2005