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

%I #19 Dec 07 2019 12:18:22

%S 1,1,6,720,3628800,1307674368000,51090942171709440000,

%T 304888344611713860501504000000,

%U 371993326789901217467999448150835200000000,119622220865480194561963161495657715064383733760000000000,12696403353658275925965100847566516959580321051449436762275840000000000000

%N a(n) = (n*(n+1)/2)!.

%C Factorials of triangular numbers. - _Harvey P. Dale_, Aug 13 2012

%H Christian Gaetz, Yibo Gao, <a href="https://arxiv.org/abs/1905.00047">Padded Schubert polynomials and weighted enumeration of Bruhat chains</a>, arXiv:1905.00047 [math.CO], 2019. This sequence but shifted: f(n) = binomial(n, 2)!.

%F a(n) = A000142(A000217(n)). - _Henry Bottomley_, Jun 02 2000

%t Accumulate[Range[0,10]]! (* _Harvey P. Dale_, Aug 13 2012 *)

%o (Sage) [(factorial(binomial(n,2))) for n in range(1, 15)] # _Zerinvary Lajos_, Nov 30 2009

%K nonn,easy

%O 0,3

%A Jeevan Chana Rai (Karanjit.Rai(AT)btinternet.com), Feb 09 2000

%E An incorrect formula was deleted by _N. J. A. Sloane_, Sep 21 2008

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 September 14 15:51 EDT 2024. Contains 375924 sequences. (Running on oeis4.)