Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003161
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003161 A binomial coefficient sum.
(Formerly M1931)
+0
5
1, 1, 2, 9, 36, 190, 980, 5705, 33040, 204876, 1268568, 8209278, 53105976, 354331692, 2364239592, 16140234825, 110206067400, 765868074400, 5323547715200, 37525317999884, 264576141331216, 1886768082651816 (list; graph; listen)
OFFSET

0,3

COMMENT

The number of triples of standard tableaux of the same shape of height less than or equal to 2. - Mike Zabrocki (zabrocki(AT)mathstat.yorku.ca), Mar 29 2007

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Problem E2384, Amer. Math. Monthly, 81 (1974), 170-171.

F. Bergeron, L. Favreau and D. Krob, Conjectures on the enumeration of tableaux of bounded height, Discrete Math, vol. 139, no. 1-3 (1995), 463-468.

FORMULA

a(n)=Sum_{k, 0=k<=n}A120730(n,k)^3 . [From Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Oct 18 2008]

PROGRAM

(PARI) a(n)=sum(k=0, n\2, (binomial(n, k)-binomial(n, k-1))^3) /* Michael Somos Jun 02 2005 */

CROSSREFS

Cf. A003162.

Cf. A001405, A000108, A129123.

Sequence in context: A137955 A150981 A150982 this_sequence A101610 A111601 A037553

Adjacent sequences: A003158 A003159 A003160 this_sequence A003162 A003163 A003164

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research