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”).

A138778
Triangle read by rows: T(n,k)=k*binomial(n-2k,3k) (n>=5, 1<=k<=n/5).
0
1, 4, 10, 20, 35, 56, 2, 84, 14, 120, 56, 165, 168, 220, 420, 286, 924, 3, 364, 1848, 30, 455, 3432, 165, 560, 6006, 660, 680, 10010, 2145, 816, 16016, 6006, 4, 969, 24752, 15015, 52, 1140, 37128, 34320, 364
OFFSET
5,2
COMMENTS
Row n contains floor(n/5) terms.
Row sums yield A137359.
REFERENCES
D. E. Knuth, The Art of Computer Programming, Vol. 4A, Section 7.1.4.
MAPLE
T:=proc(n, k) options operator, arrow: k*binomial(n-2*k, 3*k) end proc: for n from 5 to 22 do seq(T(n, k), k=1..(1/5)*n) end do; # yields sequence in triangular form
MATHEMATICA
Flatten[Table[k*Binomial[n-2k, 3k], {n, 5, 30}, {k, 1, n/5}]] (* Harvey P. Dale, Dec 20 2014 *)
CROSSREFS
Cf. A137359.
Sequence in context: A301007 A127764 A374713 * A301244 A038409 A374710
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, May 10 2008
STATUS
approved