id:A052553 - OEIS Search Results

Search: id:A052553

Displaying 1-1 of 1 results found.

page 1

Square array of binomial coefficients T(n,k) = binomial(n,k), n >= 0, k >= 0, read by antidiagonals.

+0
7

1, 1, 0, 1, 1, 0, 1, 2, 0, 0, 1, 3, 1, 0, 0, 1, 4, 3, 0, 0, 0, 1, 5, 6, 1, 0, 0, 0, 1, 6, 10, 4, 0, 0, 0, 0, 1, 7, 15, 10, 1, 0, 0, 0, 0, 1, 8, 21, 20, 5, 0, 0, 0, 0, 0, 1, 9, 28, 35, 15, 1, 0, 0, 0, 0, 0, 1, 10, 36, 56, 35, 6, 0, 0, 0, 0, 0, 0, 1, 11, 45, 84, 70, 21, 1, 0, 0, 0, 0, 0, 0, 1, 12, 55 (list; table; graph; listen)

	OFFSET	`0,8`
	COMMENT	`Another version of Pascal's triangle A007318.`
	LINKS	`Index entries for triangles and arrays related to Pascal's triangle`
	EXAMPLE	`Array begins:` `1 0 0 0 0 0 ...` `1 1 0 0 0 0 ...` `1 2 1 0 0 0 ...` `1 3 3 1 0 0 ...` `1 4 6 4 1 0 ...` `1 5 10 10 5 1 ...` with(combinat): for s from 0 to 20 do for n from s to 0 by -1 do printf(`%d,`, binomial(n, s-n)) od:od:
	CROSSREFS	`The official entry for Pascal's triangle is A007318. See also A026729.` `Cf. A052509, A054123, A054124, A008949.` `Sequence in context: A029362 A114510 A077029 this_sequence A045847 A137586 A157608` `Adjacent sequences: A052550 A052551 A052552 this_sequence A052554 A052555 A052556`
	KEYWORD	`nonn,tabl,easy,nice`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Mar 17 2000`
	EXTENSIONS	`More terms and Maple code from James A. Sellers (sellersj(AT)math.psu.edu), Mar 17 2000`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research