Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080233
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A080233 Triangle T(n,k) obtained by taking differences of consecutive pairs of row elements of Pascal's triangle A007318. +0
3
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; graph; listen)
OFFSET

0,8

COMMENT

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. [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 14 2009]

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}, ...

CROSSREFS

Cf. A007318, A080232.

Sequence in context: A029221 A029183 A138110 this_sequence A156644 A097808 A114325

Adjacent sequences: A080230 A080231 A080232 this_sequence A080234 A080235 A080236

KEYWORD

easy,sign

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Feb 10 2003

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research