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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064382 Number of ways to put numbers 1, 2, ..., n*(n+1)/2 in a triangular array of n rows in such a way that each row is increasing or decreasing. 0
1, 6, 240, 100800, 605404800, 65703372134400, 155590841484029952000, 9416463528385701835407360000, 16689045681854870055279680279347200000, 976264092939656812770160178186221444104192000000, 2097176933095579995533106263090939623313258344938995712000000 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

FORMULA

a(n) = 2^(n-1) * A022915(n) = 2^(n-1) * (n*(n+1)/2)!/(1!*2!*...*n!)

CROSSREFS

A022915.

Sequence in context: A065948 A052510 A137892 * A080358 A156936 A072228

Adjacent sequences:  A064379 A064380 A064381 * A064383 A064384 A064385

KEYWORD

nonn

AUTHOR

Dan Fux (dan.fux(AT)OpenGaia.com or danfux(AT)OpenGaia.com), Sep 27 2001

EXTENSIONS

Corrected and extended by Vladeta Jovovic (vladeta(AT)eunet.rs), Sep 28 2001

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 16 14:37 EST 2012. Contains 205930 sequences.