login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098173 Triangle T(n,k) with diagonals T(n,n-k) = binomial(n, 4k). 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 (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},
...
MATHEMATICA
Table[Binomial[n, 4(n-k)], {n, 0, 12}, {k, 0, n}]//Flatten (* G. C. Greubel, Mar 15 2019 *)
PROG
(PARI) {T(n, k) = binomial(n, 4*(n-k))}; \\ G. C. Greubel, Mar 15 2019
(Magma) [[Binomial(n, 4*(n-k)): k in [0..n]]: n in [0..12]]; // G. C. Greubel, Mar 15 2019
(Sage) [[binomial(n, 4*(n-k)) for k in (0..n)] for n in (0..12)] # G. C. Greubel, Mar 15 2019
(GAP) Flat(List([0..12], n-> List([0..n], k-> Binomial(n, 4*(n-k)) ))); # G. C. Greubel, Mar 15 2019
CROSSREFS
Sequence in context: A249737 A129205 A327581 * A180977 A371761 A269129
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 16 21:21 EDT 2024. Contains 375191 sequences. (Running on oeis4.)