|
%I #17 Aug 20 2021 12:25:35
%S 8,20,44,50,68,92,110,116,125,164,170,188,212,230,236,242,275,284,290,
%T 332,356,374,404,410,425,428,452,470,506,524,530,548,575,578,590,596,
%U 605,638,668,692,710,716,725,764,782,788,830,890,902,908,932,935,956
%N Products of three terms from A003627.
%C It would be incorrect to call these Eisenstein 3-almost primes. For the Eisenstein primes see A055664. - _N. J. A. Sloane_, Feb 06 2008.
%D J. H. Conway and R. K. Guy, The Book of Numbers. New York: Springer-Verlag, pp. 220-223, 1996.
%D Stan Wagon, "Eisenstein Primes," Section 9.8 in Mathematica in Action. New York: W. H. Freeman, pp. 319-323, 1991.
%H Giovanni Resta, <a href="/A121307/b121307.txt">Table of n, a(n) for n = 1..10000</a>
%t ok[n_] := Block[{f = FactorInteger@n}, Plus @@ Last /@ f == 3 && Max@ Mod[1 + First /@ f, 3] == 0]; Select[Range@ 1000, ok] (* _Giovanni Resta_, Jun 12 2016 *)
%o (PARI) list(lim)=my(v=List(),u=v,t); forprime(p=2,lim\4, if(p%3==2, listput(u,p))); for(i=1,#u, for(j=i,#u, if(u[i]*u[j]^2>lim, break); for(k=j,#u, t=u[i]*u[j]*u[k]; if(t>lim, break); listput(v,t)))); Set(v) \\ _Charles R Greathouse IV_, Jan 31 2017
%o (Python)
%o from sympy import primerange
%o from itertools import combinations_with_replacement as mc
%o def aupto(limit):
%o terms = [p for p in primerange(2, limit//4+1) if p%3 == 2]
%o return sorted(set(a*b*c for a, b, c in mc(terms, 3) if a*b*c <= limit))
%o print(aupto(957)) # _Michael S. Branicky_, Aug 20 2021
%Y Cf. A003627, A014612, A112770.
%K easy,nonn
%O 1,1
%A _Jonathan Vos Post_, Sep 05 2006
%E Definition corrected by _N. J. A. Sloane_, Feb 06 2008
%E a(37)-a(53) from _Giovanni Resta_, Jun 12 2016
|
