login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A090971 Triangle read by rows: T(n,k) = {T(n-1,k)+T(n-1,k-1)} mod 2. 0
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; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

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

PROG

(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: A104521 A131379 A181656 * A105594 A091949 A039984

Adjacent sequences:  A090968 A090969 A090970 * A090972 A090973 A090974

KEYWORD

nonn,tabl

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 28 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 11:52 EST 2012. Contains 205778 sequences.