Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098173
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098173 Triangle T(n,k) with diagonals T(n,n-k)=Binomial(n,4k). +0
2
1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 5, 1, 0, 0, 0, 0, 0, 15, 1, 0, 0, 0, 0, 0, 0, 35, 1, 0, 0, 0, 0, 0, 0, 1, 70, 1, 0, 0, 0, 0, 0, 0, 0, 9, 126, 1, 0, 0, 0, 0, 0, 0, 0, 0, 45, 210, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 165, 330, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 495, 495, 1, 0, 0, 0, 0, 0, 0 (list; table; graph; listen)
OFFSET

0,20

COMMENT

Row sums are A038503.

FORMULA

Triangle T(n, k)=Binomial(n, 4(n-k)).

EXAMPLE

Rows begin {1}, {0,1}, {0,0,1}, {0,0,0,1}, {0,0,0,1,1}, {0,0,0,0,5,1},...

CROSSREFS

Cf. A098158, A098172.

Sequence in context: A027641 A164555 A129205 this_sequence A058177 A079508 A007912

Adjacent sequences: A098170 A098171 A098172 this_sequence A098174 A098175 A098176

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Aug 30 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 November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research