id:A101598 - OEIS Search Results

Search: id:A101598

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,18`
	LINKS	`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: A088018 A099384 A015716 this_sequence A157129 A101615 A140193` `Adjacent sequences: A101595 A101596 A101597 this_sequence A101599 A101600 A101601`
	KEYWORD	`nonn,tabl,base`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 08 2004`

page 1

Search completed in 0.002 seconds

Last modified December 15 00:47 EST 2009. Contains 170825 sequences.

AT&T Labs Research