login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098157 Triangle T(n,k) with diagonals T(n,n-k)=binomial(n+1,2k). 1
1, 1, 1, 0, 3, 1, 0, 1, 6, 1, 0, 0, 5, 10, 1, 0, 0, 1, 15, 15, 1, 0, 0, 0, 7, 35, 21, 1, 0, 0, 0, 1, 28, 70, 28, 1, 0, 0, 0, 0, 9, 84, 126, 36, 1, 0, 0, 0, 0, 1, 45, 210, 210, 45, 1, 0, 0, 0, 0, 0, 11, 165, 462, 330, 55, 1, 0, 0, 0, 0, 0, 1, 66, 495, 924, 495, 66, 1, 0, 0, 0, 0, 0, 0, 13, 286 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Row sums are A000079. Diagonal sums are A062200. Inverse is A065547, less the first column.

FORMULA

Triangle T(n, k)=binomial(n+1, 2(n-k)).

EXAMPLE

Rows begin {1}, {1,1}, {0,3,1}, {0,1,6,1), {0,0,5,10,1}, {0,0,1,15,15,1},...

CROSSREFS

Sequence in context: A121314 A119271 A125104 * A165253 A059045 A122935

Adjacent sequences:  A098154 A098155 A098156 * A098158 A098159 A098160

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Aug 29 2004

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 11:51 EST 2012. Contains 205908 sequences.