This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A258568 Smallest prime factors of 3-full numbers. 6
 1, 2, 2, 3, 2, 2, 3, 5, 2, 2, 3, 2, 7, 2, 2, 5, 2, 3, 2, 2, 2, 2, 11, 2, 2, 2, 2, 3, 13, 7, 2, 2, 5, 3, 2, 2, 2, 2, 17, 2, 2, 2, 2, 3, 19, 2, 2, 2, 2, 3, 2, 3, 2, 2, 2, 2, 23, 2, 11, 2, 5, 2, 2, 7, 3, 2, 2, 2, 3, 2, 2, 2, 2, 2, 29, 2, 2, 3, 13, 31, 3, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) = A020639(A036966(n)); a(A258600(n)) = A000040(n) and a(m) != A000040(n) for m < A258600(n). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 PROG (Haskell) a258568 = a020639 . a036966 CROSSREFS Cf. A036966, A020639, A258600, A258567, A258569, A258570, A258571. Sequence in context: A254618 A268672 A054483 * A108939 A138143 A285727 Adjacent sequences:  A258565 A258566 A258567 * A258569 A258570 A258571 KEYWORD nonn AUTHOR Reinhard Zumkeller, Jun 06 2015 STATUS approved

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

Last modified May 19 20:41 EDT 2019. Contains 323410 sequences. (Running on oeis4.)