The OEIS is supported by the many generous donors to the OEIS Foundation.

 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; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..11. FORMULA a(n) = 2^(n-1) * A022915(n) = 2^(n-1) * (n*(n+1)/2)!/(1!*2!*...*n!) CROSSREFS A022915. Sequence in context: A052510 A234633 A137892 * A080358 A233826 A156936 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, Sep 28 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 28 14:43 EDT 2023. Contains 365736 sequences. (Running on oeis4.)