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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Jun 19 2019 05:15:54
%S 1,2,2,2,1,2,3,3,2,2,2,2,2,3,2,3,2,2,3,2,2,2,3,3,3,3,2,2,2,1,3,3,2,2,
%T 2,3,2,3,3,2,2,3,2,3,3,2,3,3,2,2,3,3,3,2,3,2,2,2,3,3,3,2,3,2,3,2,2,3,
%U 2,3,3,3,2,3,2,3,3,2,2,2,2,1,3,3,2,3,2
%N Values of omega(n) (A001221) as n runs through the triprimes (A014612).
%C omega(n) is the number of distinct prime divisors of n. A number is triprime if it has exactly 3 (not necessarily distinct) prime divisors.
%C a(n) = omega(A014612(n)).
%H T. D. Noe, <a href="/A209323/b209323.txt">Table of n, a(n) for n = 1..1000</a>
%e First triprime = 8, has 1 distinct prime divisor (2) so a(1) = 1.
%t t = {}; Do[f = FactorInteger[n]; If[Total[Transpose[f][[2]]] == 3, AppendTo[t, Length[f]]], {n, 400}]; t (* _T. D. Noe_, Jan 23 2013 *)
%Y Cf. A001221, A014612.
%K nonn
%O 1,2
%A _Wesley Ivan Hurt_, Jan 19 2013