This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A258568 #18 Jun 28 2023 14:45:42
%S A258568 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,
%T A258568 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,
%U A258568 2,2,2,3,2,2,2,2,2,29,2,2,2,3,13,31,3,2,2
%N A258568 Smallest prime factors of 3-full numbers.
%H A258568 Reinhard Zumkeller, <a href="/A258568/b258568.txt">Table of n, a(n) for n = 1..10000</a> (corrected by Amiram Eldar)
%F A258568 a(n) = A020639(A036966(n)).
%F A258568 a(A258600(n)) = A000040(n) and a(m) != A000040(n) for m < A258600(n).
%t A258568 Table[If[Min[(f = FactorInteger[n])[[;; , 2]]] > 2 || n == 1, f[[1, 1]], Nothing], {n, 1, 30000}] (* _Amiram Eldar_, Feb 07 2023 *)
%o A258568 (Haskell)
%o A258568 a258568 = a020639 . a036966
%Y A258568 Cf. A036966, A020639, A258600, A258567, A258569, A258570, A258571.
%K A258568 nonn
%O A258568 1,2
%A A258568 _Reinhard Zumkeller_, Jun 06 2015
%E A258568 Missing term a(78) inserted by _Amiram Eldar_, Feb 07 2023