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 #7 Mar 30 2012 18:50:48
%S 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,2,1,1,1,1,2,2,2,1,1,1,1,2,2,2,2,
%T 1,1,1,1,2,2,2,2,2,1,1,1,1,2,2,3,3,2,2,1,1,1,2,2,3,3,2,3,3,2,2,1,1,1,
%U 1,3,2,3,3,2,3,1,1,1,1,2,1,2,3,3,3,3,3,2,1,2,1,1,2,2,3,3,4,3,3,4,3,3,2,2,1
%N Triangle read by rows: T(n,k) = number of distinct digits in decimal representation of binomial(n,k), 0<=k<=n.
%H <a href="/index/Pas#Pascal">Index entries for triangles and arrays related to Pascal's triangle</a>
%F T(n, k) = A043537(A007318(n, k)).
%Y Cf. A101599.
%K nonn,tabl,base
%O 1,18
%A _Reinhard Zumkeller_, Dec 08 2004