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 A091376 #19 Nov 26 2024 13:11:31
%S A091376 4,6,10,14,22,26,27,34,38,45,46,58,62,63,74,75,82,86,94,99,105,106,
%T A091376 117,118,122,134,142,146,147,153,158,165,166,171,178,194,195,202,206,
%U A091376 207,214,218,226,231,254,255,261,262,273,274,278,279,285,298,302,314
%N A091376 Numbers k with property that the number of prime factors of k (counted with repetition) equals the smallest prime factor of k.
%C A091376 A091371(a(n)) = 0: A001222(a(n))=A020639(a(n)).
%C A091376 Prime factors counted with multiplicity. - _Harvey P. Dale_, Nov 11 2012
%H A091376 Reinhard Zumkeller, <a href="/A091376/b091376.txt">Table of n, a(n) for n = 1..10000</a>
%t A091376 pfQ[n_]:=Module[{fi=Transpose[FactorInteger[n]]},fi[[1,1]] == Total[Last[fi]]]; Rest[Select[Range[400],pfQ]] (* _Harvey P. Dale_, Nov 11 2012 *)
%t A091376 Select[Range[400],PrimeOmega[#]==FactorInteger[#][[1,1]]&] (* _Harvey P. Dale_, Nov 26 2024 *)
%o A091376 (Haskell)
%o A091376 a091376 n = a091376_list !! (n-1)
%o A091376 a091376_list = [x | x <- a002808_list, a001222 x == a020639 x]
%o A091376 -- _Reinhard Zumkeller_, Nov 11 2012
%Y A091376 Cf. A091373, A091375, A091377.
%Y A091376 Cf. A002808.
%Y A091376 Cf. A100484 (subsequence).
%K A091376 nonn
%O A091376 1,1
%A A091376 _Reinhard Zumkeller_, Jan 04 2004
%E A091376 Definition edited by _N. J. A. Sloane_, Jan 21 2020