This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A098173 Triangle T(n,k) with diagonals T(n,n-k)=Binomial(n,4k). 1
 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; refs; listen; history; text; internal format)
 OFFSET 0,20 COMMENTS Row sums are A038503. LINKS 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: A215616 A249737 A129205 * A180977 A269129 A320606 Adjacent sequences:  A098170 A098171 A098172 * A098174 A098175 A098176 KEYWORD easy,nonn,tabl AUTHOR Paul Barry, Aug 30 2004 STATUS approved

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

Last modified January 20 16:46 EST 2019. Contains 319335 sequences. (Running on oeis4.)