login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


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
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 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

1,18

LINKS

Table of n, a(n) for n=1..105.

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

FORMULA

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

CROSSREFS

Cf. A101599.

Sequence in context: A099384 A015716 A308884 * A342461 A157129 A101615

Adjacent sequences:  A101595 A101596 A101597 * A101599 A101600 A101601

KEYWORD

nonn,tabl,base

AUTHOR

Reinhard Zumkeller, Dec 08 2004

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 08:03 EDT 2021. Contains 343146 sequences. (Running on oeis4.)