The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080233 Triangle T(n,k) obtained by taking differences of consecutive pairs of row elements of Pascal's triangle A007318. 2
1, 1, 0, 1, 1, -1, 1, 2, 0, -2, 1, 3, 2, -2, -3, 1, 4, 5, 0, -5, -4, 1, 5, 9, 5, -5, -9, -5, 1, 6, 14, 14, 0, -14, -14, -6, 1, 7, 20, 28, 14, -14, -28, -20, -7, 1, 8, 27, 48, 42, 0, -42, -48, -27, -8 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
0,8
COMMENTS
Row sums are 1,1,1,1,1,1 with g.f. 1/(1-x). Can also be obtained from triangle A080232 by taking sums of pairs of consecutive row elements.
Mirror image of triangle in A156644. - Philippe Deléham, Feb 14 2009
LINKS
FORMULA
T(n, k) = if(k>n, 0, binomial(n, k)-binomial(n, k-1)).
EXAMPLE
Rows are {1}, {1,0}, {1,1,-1}, {1,2,0,-2}, {1,3,2,-2,-3}, ...
MATHEMATICA
Table[Binomial[n, k] - Binomial[n, k - 1], {n, 0, 9}, {k, 0, n}] // Flatten (* Michael De Vlieger, Nov 24 2016 *)
PROG
(PARI) {T(n, k) = if( n<0 || k>n, 0, binomial(n, k) - binomial(n, k-1))}; /* Michael Somos, Nov 25 2016 */
CROSSREFS
Sequence in context: A339374 A265753 A138110 * A156644 A097808 A349463
KEYWORD
easy,sign,tabl
AUTHOR
Paul Barry, Feb 10 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 17:50 EDT 2024. Contains 372533 sequences. (Running on oeis4.)