This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A177227 Triangle T(n,m) read by rows: equals -binomial(n,m) in general, but 2 if n=m or m=0. 0
 2, 2, 2, 2, -2, 2, 2, -3, -3, 2, 2, -4, -6, -4, 2, 2, -5, -10, -10, -5, 2, 2, -6, -15, -20, -15, -6, 2, 2, -7, -21, -35, -35, -21, -7, 2, 2, -8, -28, -56, -70, -56, -28, -8, 2, 2, -9, -36, -84, -126, -126, -84, -36, -9, 2, 2, -10, -45, -120, -210, -252, -210, -120, -45, -10 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS The row sums are: 2, 4, 2, -2, -10, -26, -58, -122, -250, -506, -1018,... = 6-2^n for n>0. (see A131130). LINKS FORMULA T(n,n) = T(n,0)=2. T(n,m) = -binomial(n,m) if 0

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 17 11:57 EST 2019. Contains 320219 sequences. (Running on oeis4.)