%I #12 Mar 21 2015 13:25:01

%S 0,2,4,6,10,11,16,18,22,23,29,35,39,42,44,47,55,59,62,69,71,78,79,83,

%T 89,100,102,104,107,111,119,130,131,138,139,149,153,159,164,167,174,

%U 179,181,191,194,197,199,215,223,228,230,233,239,250,251,259,263,269,272,279,282

%N Least k such that number of distinct prime divisors of the numbers in row k of Pascal's triangle is n.

%C A004788(a(n)) = n and A004788(m) != n for m < a(n). - _Reinhard Zumkeller_, Mar 15 2015

%H Reinhard Zumkeller, <a href="/A004789/b004789.txt">Table of n, a(n) for n = 0..250</a>

%o (PARI) a(n) = {irow = 0; while(omega(prod(i=0, irow, binomial(irow, i)))!=n, irow++); return (irow);} \\ _Michel Marcus_, May 13 2013

%o (Haskell)

%o import Data.List (elemIndex); import Data.Maybe (fromJust)

%o a004789 = fromJust . (`elemIndex` a004788_list)

%o -- _Reinhard Zumkeller_, Mar 15 2015

%Y Cf. A004788, A256113.

%K nonn

%O 0,2

%A _Clark Kimberling_