The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101598 Triangle read by rows: T(n,k) = number of distinct digits in decimal representation of binomial(n,k), 0<=k<=n. 1

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 22 14:17 EDT 2024. Contains 373587 sequences. (Running on oeis4.)