Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A111940
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A111940 Triangle P, read by rows, that satisfies [P^-1](n,k) = P(n+1,k+1) for n>=k>=0, with P(k,k)=1 and P(k+1,1)=P(k+1,0) for k>=0, where [P^-1] denotes the matrix inverse of P. +0
4
1, 1, 1, -1, -1, 1, 0, 0, 1, 1, 0, 0, -1, -1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, -1, 1 (list; table; graph; listen)
page 1

Search completed in 0.001 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 16 17:18 EST 2009. Contains 170825 sequences.


AT&T Labs Research