A101598 Triangle read by rows: T(n,k) = number of distinct digits in decimal representation of binomial(n,k), 0<=k<=n.

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, 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, 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

Offset

0,18

Links

Table of n, a(n) for n=0..104.

Index entries for triangles and arrays related to Pascal's triangle

Formula

T(n, k) = A043537(A007318(n, k)).

Prog

(PARI) T(n, k) = length(Set(digits(binomial(n, k)))); \\ Seiichi Manyama, Dec 26 2025

Crossrefs

Cf. A007318, A043537, A101599.

Sequence in context: A099384 A015716 A308884 * A391991 A342461 A157129

Adjacent sequences: A101595 A101596 A101597 * A101599 A101600 A101601

Keyword

nonn,tabl,base

Author

Reinhard Zumkeller, Dec 08 2004

Extensions

Offset corrected by Seiichi Manyama, Dec 26 2025

Status

approved