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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A176171 Second prime-factor of n-th product of 4 distinct primes. 2
 3, 3, 3, 3, 3, 3, 3, 3, 3, 5, 3, 3, 3, 5, 3, 3, 3, 3, 5, 5, 3, 3, 3, 3, 3, 3, 5, 5, 3, 5, 3, 3, 3, 3, 5, 3, 3, 5, 3, 3, 3, 5, 3, 3, 3, 5, 7, 3, 5, 3, 5, 3, 5, 5, 3, 5, 3, 3, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 5, 7, 3, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 5, 7, 5, 3, 5, 3, 3, 7, 3, 5, 3, 5, 3, 3, 5, 5, 3, 5, 3, 5, 3, 3, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS FactorInteger[210]=2*3*5*7,... LINKS 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, f2[n]]], {n, 0, 2*7!}]; lst CROSSREFS Cf. A006881, A007304, A070647, A096916, A096917, A096918, A096919, A176170 Sequence in context: A135717 A335465 A079083 * A032568 A053388 A091786 Adjacent sequences: A176168 A176169 A176170 * A176172 A176173 A176174 KEYWORD nonn AUTHOR Vladimir Joseph Stephan Orlovsky, Apr 10 2010 STATUS approved

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.

Last modified December 8 03:48 EST 2022. Contains 358672 sequences. (Running on oeis4.)