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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A096916 Lesser prime factor of n-th product of two distinct primes. 13

%I #17 Sep 14 2015 11:41:48

%S 2,2,2,3,3,2,2,3,2,5,2,3,2,3,5,3,2,2,5,3,2,7,2,5,2,3,7,3,2,5,2,3,5,2,

%T 7,2,3,3,7,2,3,2,11,5,2,5,2,3,7,2,3,2,3,5,11,2,3,2,7,5,2,11,3,2,5,7,2,

%U 3,13,2,5,3,13,3,11,2,7,2,5,3,2,2,7,3,5,2,13,7,2,3,5,3,2,11,3,17,2,3

%N Lesser prime factor of n-th product of two distinct primes.

%C a(n)*A070647(n) = A006881(n); a(n) < A070647(n);

%C a(n) = A020639(A006881(n)).

%H Reinhard Zumkeller, <a href="/A096916/b096916.txt">Table of n, a(n) for n = 1..10000</a>

%t f[n_]:=Last/@FactorInteger[n]=={1,1};f1[n_]:=Min[First/@FactorInteger[n]];f2[n_]:=Max[First/@FactorInteger[n]];lst={};Do[If[f[n],AppendTo[lst,f1[n]]],{n,0,6!}];lst (* _Vladimir Joseph Stephan Orlovsky_, Apr 10 2010 *)

%o (Haskell)

%o a096916 = a020639 . a006881 -- _Reinhard Zumkeller_, Sep 23 2011

%o (PARI) go(x)=my(v=List()); forprime(p=2, sqrtint(x\1), forprime(q=p+1, x\p, listput(v, [p*q,p]))); apply(v->v[2], vecsort(Vec(v),1)) \\ _Charles R Greathouse IV_, Sep 14 2015

%Y Cf. A084126, A195758.

%K nonn,look

%O 1,1

%A _Reinhard Zumkeller_, Jul 15 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | 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 April 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)