%I A140077
%S A140077 230,285,429,434,455,494,560,594,609,615,644,645,650,665,740,741,759,
%T A140077 804,805,819,825,854,860,884,902,935,945,969,986,987,1001,1014,1022,
%U A140077 1034,1035,1044,1064,1065,1070,1085,1104,1105,1130,1196,1209,1220,1221
%N A140077 Numbers n such that n and n+1 have 3 distinct prime factors.
%H A140077 D. A. Goldston, S. W. Graham, J. Pintz, C. Y. Yildirim., <a href="http:/
               /front.math.ucdavis.edu/0803.2636">Small gaps between almost primes, 
               the parity problem and some conjectures of Erdos on consecutive integers</
               a>.
%t A140077 a = {}; Do[If[Length[FactorInteger[n]] == 3 && Length[FactorInteger[n 
               + 1]] == 3, AppendTo[a, n]], {n, 1, 100000}]; a (*Artur Jasinski*)
%Y A140077 Cf. A074851, A140078, A140079 .
%Y A140077 Sequence in context: A028452 A072020 A122269 this_sequence A051183 A156742 
               A031965
%Y A140077 Adjacent sequences: A140074 A140075 A140076 this_sequence A140078 A140079 
               A140080
%K A140077 nonn
%O A140077 1,1
%A A140077 Artur Jasinski (grafix(AT)csl.pl), May 07 2008