Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A138778
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A138778 Triangle read by rows: T(n,k)=k*binomial(n-2k,3k) (n>=5, 1<=k<=n/5). +0
1
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 (list; graph; listen)
OFFSET

5,2

COMMENT

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

CROSSREFS

Cf. A137359.

Adjacent sequences: A138775 A138776 A138777 this_sequence A138779 A138780 A138781

Sequence in context: A008144 A038406 A127764 this_sequence A038409 A090579 A000292

KEYWORD

nonn,tabf

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), May 10 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 8 20:39 EST 2009. Contains 166234 sequences.


AT&T Labs Research