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.

A105572 Numbers m such that m-3 and m+3 have 3 prime factors.

This page as a plain text file.
%I A105572 #16 May 07 2023 12:09:23
%S A105572 15,47,73,95,102,113,127,150,151,167,168,185,233,239,241,258,276,282,
%T A105572 287,289,313,319,335,360,366,407,409,415,426,431,432,433,439,480,521,
%U A105572 527,552,558,593,599,601,606,607,612,642,648,649,654,655,660,708,713
%N A105572 Numbers m such that m-3 and m+3 have 3 prime factors.
%C A105572 A001222(a(n)-3) = A001222(a(n)+3) = 3.
%C A105572 Prime factors counted with multiplicity. - _Harvey P. Dale_, May 07 2023
%H A105572 Harvey P. Dale, <a href="/A105572/b105572.txt">Table of n, a(n) for n = 1..1000</a>
%e A105572 From _Jon E. Schoenfield_, Jan 19 2015: (Start)
%e A105572 73 - 3 = 70 = 2 * 5 * 7 and 73 + 3 = 76 = 2 * 2 * 19 so 73 is in the sequence.
%e A105572 81 - 3 = 78 = 2 * 3 * 13 but 81 + 3 = 84 = 2 * 2 * 3 * 7 so 81 is not in the sequence. (End)
%t A105572 q=3;lst={};Do[If[Plus@@Last/@FactorInteger[n-q]==q&&Plus@@Last/@FactorInteger[n+q]==q,AppendTo[lst,n]],{n,7!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Feb 01 2009 *)
%t A105572 Flatten[Position[Partition[PrimeOmega[Range[800]],7,1],_?(#[[1]]==#[[7]]==3&),1,Heads-> False]]+3 (* _Harvey P. Dale_, May 07 2023 *)
%Y A105572 Cf. A014574, A105571, A105573.
%K A105572 nonn
%O A105572 1,1
%A A105572 _Reinhard Zumkeller_, Apr 14 2005