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

A138777
Triangle read by rows: T(n,k)=binomial(n-2k,3k+2) (n>=2, 0<=k<=(n-2)/5).
0
1, 3, 6, 10, 15, 21, 1, 28, 6, 36, 21, 45, 56, 55, 126, 66, 252, 1, 78, 462, 9, 91, 792, 45, 105, 1287, 165, 120, 2002, 495, 136, 3003, 1287, 1, 153, 4368, 3003, 12, 171, 6188, 6435, 78, 190, 8568, 12870, 364
OFFSET
2,2
COMMENTS
Row n contains floor((n+3)/5) terms.
Row sums yield A137358.
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+2) end proc: for n from 2 to 20 do seq(T(n, k), k=0..(n-2)*1/5) end do; # yields sequence in triangular form
MATHEMATICA
Flatten[Table[Binomial[n-2k, 3k+2], {n, 2, 20}, {k, 0, (n-2)/5}]] (* Harvey P. Dale, Mar 07 2013 *)
CROSSREFS
Cf. A137358.
Sequence in context: A037452 A047800 A109443 * A096895 A034175 A361670
KEYWORD
nonn,tabf
AUTHOR
Emeric Deutsch, May 10 2008
STATUS
approved

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy