Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098157
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098157 Triangle T(n,k) with diagonals T(n,n-k)=binomial(n+1,2k). +0
2
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; listen)
OFFSET

0,5

COMMENT

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 this_sequence A165253 A059045 A122935

Adjacent sequences: A098154 A098155 A098156 this_sequence A098158 A098159 A098160

KEYWORD

easy,nonn,tabl

AUTHOR

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

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