id:A090971 - OEIS Search Results

Search: id:A090971

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: T(n,k) = {T(n-1,k)+T(n-1,k-1)} mod 2.

+0
1

1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1 (list; table; graph; listen)

	OFFSET	`1,1`
	COMMENT	`Row sums give A038573.`
	FORMULA	`Triangle A047999(n, k) for n>0 and k>0; A047999 : Pascal's triangle mod 2 . a(n) = A062534(n-1) mod 2 . T(n-1, k-1) = A074909(n, n-k) mod 2 . - DELEHAM Philippe (kolotoko(AT)wanadoo.fr), Feb 29 2004`
	PROGRAM	`(PARI) T(n, k)=if(k<0\|k>n, 0, if(n==0, 1, (T(n-1, k)+T(n-1, k-1))%2))`
	CROSSREFS	`Cf. A007318.` `Sequence in context: A059778 A104521 A131379 this_sequence A105594 A091949 A039984` `Adjacent sequences: A090968 A090969 A090970 this_sequence A090972 A090973 A090974`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 28 2004`

page 1

Search completed in 0.002 seconds

Last modified December 13 23:45 EST 2009. Contains 170824 sequences.

AT&T Labs Research