login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A138776
Triangle read by rows: T(n,k)=binomial(n-2k,3k+1) (n>=1, 0<=k<=(n-1)/5).
0
1, 2, 3, 4, 5, 6, 1, 7, 5, 8, 15, 9, 35, 10, 70, 11, 126, 1, 12, 210, 8, 13, 330, 36, 14, 495, 120, 15, 715, 330, 16, 1001, 792, 1, 17, 1365, 1716, 11, 18, 1820, 3432, 66, 19, 2380, 6435, 286, 20, 3060, 11440, 1001
OFFSET
1,2
COMMENTS
Row n contains floor((n+4)/5) terms.
Row sums yield A137357.
REFERENCES
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
MAPLE
T:=proc(n, k) options operator, arrow: binomial(n-2*k, 3*k+1) end proc: for n to 20 do seq(T(n, k), k=0..(n-1)*1/5) end do; # yields sequence in triangular form
MATHEMATICA
Table[Binomial[n-2k, 3k+1], {n, 30}, {k, 0, (n-1)/5}]//Flatten (* Harvey P. Dale, Aug 12 2018 *)
CROSSREFS
Cf. A137357.
Sequence in context: A319092 A243733 A334618 * A379005 A339738 A364500
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, May 10 2008
STATUS
approved