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!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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

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 March 28 13:42 EDT 2024. Contains 371254 sequences. (Running on oeis4.)