Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A108086
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A108086 Triangle, read by rows, where T(0,0) = 1, T(n,k) = (-1)^(n+k)*T(n-1,k) + T(n-1,k-1); a signed version of Pascal's triangle. +0
1
1, -1, 1, -1, -2, 1, 1, -3, -3, 1, 1, 4, -6, -4, 1, -1, 5, 10, -10, -5, 1, -1, -6, 15, 20, -15, -6, 1, 1, -7, -21, 35, 35, -21, -7, 1, 1, 8, -28, -56, 70, 56, -28, -8, 1, -1, 9, 36, -84, -126, 126, 84, -36, -9, 1, -1, -10, 45, 120, -210, -252, 210, 120, -45, -10, 1, 1, -11, -55, 165, 330, -462, -462, 330, 165, -55, -11, 1 (list; table; graph; listen)
page 1

Search completed in 0.002 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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research