Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130721
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130721 Sum of the cubes of the number of standard Young tableaux over all partitions of n. +0
1
1, 1, 2, 10, 64, 596, 8056, 130432, 2534960, 59822884, 1718480368, 56754444440 (list; graph; listen)
OFFSET

0,3

COMMENT

The sum of the zero-th power of the number f(p) of standard Young tableaux gives the partition function (A000041), the sum of the first power of f(p) gives the involution function (A000085), the sum of the squares of f(p) gives the factorial function (A000142), so this sequence is the natural one after them.

FORMULA

For p a partition of n, let f(p) be the number of standard Young tableaux with shape p. Then a(n) = sum(f(p)^3) where the sum ranges over all partitions p of n.

EXAMPLE

a(4) = 1^3 + 3^3 + 2^3 + 3^3 + 1^3 because the five partitions of 4 (namely 4, 3+1, 2+2, 2+1+1, 1+1+1+1) have respectively 1, 3, 2, 3, 1 standard Young tableaux.

CROSSREFS

Cf. A000041, A000085, A000142.

Sequence in context: A141140 A129130 A078531 this_sequence A064170 A151410 A027307

Adjacent sequences: A130718 A130719 A130720 this_sequence A130722 A130723 A130724

KEYWORD

nonn

AUTHOR

David A. Madore (david.madore(AT)ens.fr), Jul 03 2007

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 December 2 15:58 EST 2008. Contains 150992 sequences.


AT&T Labs Research