login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A005987 Number of symmetric plane partitions of n.
(Formerly M0562)
10
1, 1, 1, 2, 3, 4, 6, 8, 12, 16, 22, 29, 41, 53, 71, 93, 125, 160, 211, 270, 354, 450, 581, 735, 948, 1191, 1517, 1902, 2414, 3008, 3791, 4709, 5909, 7311, 9119, 11246, 13981, 17178, 21249, 26039, 32105, 39213, 48159, 58669, 71831, 87269 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

REFERENCES

D. M. Bressoud, Proofs and Confirmations, Camb. Univ. Press, 1999; p. 134.

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

R. P. Stanley, Theory and application of plane partitions II, Studies in Appl. Math., 50 (1971), 259-279.

R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Corollary 7.20.5

LINKS

T. D. Noe, Table of n, a(n) for n=0..1000

R. P. Stanley, A combinatorial miscellany

FORMULA

G.f.: Product[ 1/(1-x^(2i-1))/(1-x^(2i))^Floor[i/2], {i, 1, Infinity} ] (R. P. Stanley)

PROG

(PARI) a(n)=polcoeff(prod(k=1, n, (1-x^k)^-if(k%2, 1, k\4), 1+x*O(x^n)), n)

CROSSREFS

Cf. A000784, A000785, A000786, A000219, A048142.

Sequence in context: A036451 A180652 A046682 * A125895 A064428 A052810

Adjacent sequences:  A005984 A005985 A005986 * A005988 A005989 A005990

KEYWORD

nonn,nice,easy

AUTHOR

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

EXTENSIONS

More terms from Wouter Meeussen (wouter.meeussen(AT)pandora.be). Additional comments from Michael Somos, May 19, 2000.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 21:56 EST 2012. Contains 205860 sequences.