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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098172 Triangle T(n,k) with diagonals T(n,n-k)=Binomial(n,3k). 2
1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 4, 1, 0, 0, 0, 0, 10, 1, 0, 0, 0, 0, 1, 20, 1, 0, 0, 0, 0, 0, 7, 35, 1, 0, 0, 0, 0, 0, 0, 28, 56, 1, 0, 0, 0, 0, 0, 0, 1, 84, 84, 1, 0, 0, 0, 0, 0, 0, 0, 10, 210, 120, 1, 0, 0, 0, 0, 0, 0, 0, 0, 55, 462, 165, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 220, 924, 220, 1, 0, 0 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,14

COMMENTS

Row sums are A024493.

FORMULA

Triangle T(n, k)=Binomial(n, 3(n-k))

EXAMPLE

Rows begin {1}, {0,1}, {0,0,1}, {0,0,1,1}, {0,0,0,4,1}, {0,0,0,0,10,1},...

CROSSREFS

Cf. A098158.

Sequence in context: A124120 A093318 A127560 * A049759 A137252 A036875

Adjacent sequences:  A098169 A098170 A098171 * A098173 A098174 A098175

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), Aug 30 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 15 09:49 EST 2012. Contains 205763 sequences.