Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A123401
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A123401 Number of maximal chains in the Stanley lattice of order n. +0
1
1, 1, 1, 18, 32400, 17146080000, 5838929512416000000, 2371384771694500507545600000000, 1912347371757319698802901729638809600000000000, 4729554291048229774403876712233157022270603395072000000000000000, 52408889027141714669562863434538278134100104813558451332105036103680000000000000\ 000000 (list; graph; listen)
OFFSET

0,4

REFERENCES

D. E. Knuth, TAOCP, Section 7.2.1.6, Problem 34.

FORMULA

(n*(n-1)/2)! * Product( (2*i-1)^(n-i),i=1..n-1).

MAPLE

f:=n-> (n*(n-1)/2)! * mul( (2*i-1)^(n-i), i=1..n-1);

CROSSREFS

Sequence in context: A060617 A153301 A129042 this_sequence A079303 A159445 A146548

Adjacent sequences: A123398 A123399 A123400 this_sequence A123402 A123403 A123404

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Oct 15 2006

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research