id:A085476 - OEIS Search Results

Search: id:A085476

Displaying 1-1 of 1 results found.

page 1

Periodic Pascal array, read by antidiagonals.

+0
1

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 4, 3, 1, 1, 1, 1, 5, 6, 1, 2, 1, 1, 1, 6, 10, 4, 1, 1, 1, 1, 1, 7, 15, 10, 1, 3, 1, 1, 1, 1, 8, 21, 20, 5, 1, 3, 2, 1, 1, 1, 9, 28, 35, 15, 1, 4, 1, 1, 1, 1, 1, 10, 36, 56, 35, 6, 1, 6, 1, 1, 1, 1 (list; table; graph; listen)

	OFFSET	`0,8`
	COMMENT	`G.f. of binomial transform of k-th row is given by 1/((1-x)^(k+1)-x^(k+1))`
	FORMULA	`Square array T(n, k)=C(k, n mod (k+1)).`
	EXAMPLE	`Rows begin` `1 1 1 1 1 1 ...` `1 1 1 1 1 1 ...` `1 2 1 1 2 1 ...` `1 3 3 1 1 3 ...` `1 4 6 4 1 1 ...`
	CROSSREFS	`Cf. A007318, A000749, A049016, A006090, A049017.` `Sequence in context: A095025 A069897 A107682 this_sequence A124944 A094392 A111946` `Adjacent sequences: A085473 A085474 A085475 this_sequence A085477 A085478 A085479`
	KEYWORD	`easy,nonn,tabl`
	AUTHOR	`Paul Barry (pbarry(AT)wit.ie), Jul 02 2003`

page 1

Search completed in 0.002 seconds

Last modified December 19 21:04 EST 2009. Contains 171054 sequences.

AT&T Labs Research