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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052295 a(n) = (n*(n+1)/2)!. 6
1, 1, 6, 720, 3628800, 1307674368000, 51090942171709440000, 304888344611713860501504000000, 371993326789901217467999448150835200000000, 119622220865480194561963161495657715064383733760000000000, 12696403353658275925965100847566516959580321051449436762275840000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
Factorials of triangular numbers. - Harvey P. Dale, Aug 13 2012
LINKS
Christian Gaetz, Yibo Gao, Padded Schubert polynomials and weighted enumeration of Bruhat chains, arXiv:1905.00047 [math.CO], 2019. This sequence but shifted: f(n) = binomial(n, 2)!.
FORMULA
a(n) = A000142(A000217(n)). - Henry Bottomley, Jun 02 2000
MATHEMATICA
Accumulate[Range[0, 10]]! (* Harvey P. Dale, Aug 13 2012 *)
PROG
(Sage) [(factorial(binomial(n, 2))) for n in range(1, 15)] # Zerinvary Lajos, Nov 30 2009
CROSSREFS
Sequence in context: A100732 A003923 A002204 * A169668 A168467 A080369
KEYWORD
nonn,easy
AUTHOR
Jeevan Chana Rai (Karanjit.Rai(AT)btinternet.com), Feb 09 2000
EXTENSIONS
An incorrect formula was deleted by N. J. A. Sloane, Sep 21 2008
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 10 13:23 EDT 2024. Contains 375056 sequences. (Running on oeis4.)