login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


A176170
Smallest prime-factor of n-th product of 4 distinct primes.
4
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2
OFFSET
1,1
COMMENTS
FactorInteger[210]=2*3*5*7,...
LINKS
FORMULA
a(n) = A020639(A046386(n)). - Antti Karttunen, Dec 06 2017
MATHEMATICA
f0[n_]:=Last/@FactorInteger[n]=={1, 1, 1, 1}; f1[n_]:=Min[First/@FactorInteger[n]]; f2[n_]:=First/@FactorInteger[n][[2, 1]]; f3[n_]:=First/@FactorInteger[n][[3, 1]]; f4[n_]:=Max[First/@FactorInteger[n]]; lst={}; Do[If[f0[n], AppendTo[lst, f1[n]]], {n, 0, 2*7!}]; lst
PROG
(PARI) n=0; i=0; while(i<10000, n++; if((4 == bigomega(n))&&(4 == omega(n)), i++; write("b176170.txt", i, " ", factor(n)[1, 1]))); \\ Antti Karttunen, Dec 06 2017
KEYWORD
nonn
AUTHOR
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 22:42 EDT 2024. Contains 376078 sequences. (Running on oeis4.)