This site is supported by donations to The OEIS Foundation.



The OEIS is looking to hire part-time people to help edit core sequences, upload scanned documents, process citations, fix broken links, etc. - Neil Sloane, njasloane@gmail.com

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A006472 a(n) = n!*(n-1)!/2^(n-1).
(Formerly M3052)
1, 1, 3, 18, 180, 2700, 56700, 1587600, 57153600, 2571912000, 141455160000, 9336040560000, 728211163680000, 66267215894880000, 6958057668962400000, 834966920275488000000, 113555501157466368000000, 17373991677092354304000000, 2970952576782792585984000000 (list; graph; refs; listen; history; text; internal format)



Product of first (n-1) positive triangular numbers. Might be called a triangular factorial number. - Amarnath Murthy, May 19 2002, corrected by Alex Ratushnyak, Dec 03 2013

Number of ways of transforming n distinguishable objects into n singletons via a sequence of n-1 refinements. Example: a(3)=3 because we have XYZ->X|YZ->X|Y|Z, XYZ->Y|XZ->X|Y|Z and XYZ->Z|XY->X|Y|Z. - Emeric Deutsch, Jan 23 2005

From David Callan, Aug 27 2009: (Start)

With offset 0, a(n) = number of unordered increasing full binary trees of 2n edges with leaf set {n,n+1,...,2n}, where full binary means each nonleaf vertex has two children, increasing means the vertices are labeled 0,1,2,...,2n and each child is greater than its parent, unordered might as well mean ordered and each pair of sibling vertices is increasing left to right. For example, a(2)=3 counts the trees with edge lists {01,02,13,14}, {01,03,12,14}, {01,04,12,13}.

PROOF. Given such a tree of size n, to produce a tree of size n+1, two new leaves must be added to the leaf n. Choose any two of the leaf set {n+1,...,2n,2n+1,2n+2} for the new leaves and use the rest to replace the old leaves n+1,...,2n, maintaining relative order. Thus each tree of size n yields (n+2)-choose-2 trees of the next size up. Since the ratio a(n+1)/a(n)=(n+2)-choose-2, the result follows by induction.

Without the condition on the leaves, these trees are counted by the reduced tangent numbers A002105. (End)

a(n) = Sum(M(t)N(t)), where summation is over all rooted trees t with n vertices, M(t) is the number of ways to take apart t by sequentially removing terminal edges (see A206494) and N(t) is  the number of ways to build up t from the one-vertex tree by adding successively edges to the existing vertices (the Connes-Moscovici weight; see A206496). See Remark on p. 3801 of the Hoffman reference. Example: a(3) = 3; indeed, there are two rooted trees with 3 vertices: t' = the path r-a-b and t" = V; we have M(t')=N(t')=1 and M(t") =1, N(t")=2, leading to M(t')N(t') + M(t")N(t")=3. - Emeric Deutsch, Jul 20 2012


L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 148.

L. Lovasz, Combin. Problems and Exercises, North-Holland, 1979, p. 165.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).


T. D. Noe, Table of n, a(n) for n = 1..50

Karl Dienger, Beiträge zur Lehre von den arithmetischen und geometrischen Reihen höherer Ordnung, Jahres-Bericht Ludwig-Wilhelm-Gymnasium Rastatt, Rastatt, 1910. [Annotated scanned copy]

Daniel Dockery, Polygorials, Special "Factorials" of Polygonal Numbers.

Filippo Disanto and Thomas Wiehe, Some combinatorial problems on binary rooted trees occurring in population genetics, arXiv preprint arXiv:1112.1295 [math.CO], 2011-2012.

P. Erdős, R. K. Guy and J. W. Moon, On refining partitions, J. London Math. Soc., 9 (1975), 565-570.

L. Ferretti, F. Disanto and T, Wiehe, The Effect of Single Recombination Events on Coalescent Tree Height and Shape, PLoS ONE 8(4): e60123.

O. Frank and K. Svensson, On probability distributions of single-linkage dendrograms, Journal of Statistical Computation and Simulation, 12 (1981), 121-131.

M. E. Hoffman, Combinatorics of rooted trees and Hopf algebras, Trans. Amer. Math. Soc., 355, 2003, 3795-3811.

F. Murtagh, Counting dendrograms: a survey, Discrete Applied Mathematics, 7 (1984), 191-199.

Index entries for sequences related to factorial numbers


a(n) = a(n-1)*A000217(n-1).

a(n) = A010790(n-1)/2^(n-1).

a(n) = Polygorial(n, 3) = A000142(n)/A000079(n)*A000142(n+1) = n!/2^n*product(i+2, i=0..n-1) = n!/2^n*pochhammer(2, n) = n!^2/2^n*(n+1) = Polygorial(n, 4)/2^n*(n+1). - Daniel Dockery (peritus(AT)gmail.com), Jun 13 2003

a(n-1) = (-1)^(n+1)/n^2/det(M_n) where M_n is the matrix M_(i, j)=abs(1/i-1/j). - Benoit Cloitre, Aug 21 2003

From Ilya Gutkovskiy, Dec 15 2016: (Start)

a(n) ~ 4*Pi*n^(2*n)/(2^n*exp(2*n)).

Sum_{n>=1} 1/a(n) = BesselI(1,2*sqrt(2))/sqrt(2) = 2.3948330992734... (End)


A006472 := n->n!*(n-1)!/2^(n-1);


FoldList[Times, 1, Accumulate[Range[20]]] (* Harvey P. Dale, Jan 10 2013 *)


(PARI) a(n) = n*(n-1)!^2/2^(n-1) \\ Charles R Greathouse IV, May 18 2015


Cf. A084939, A084940, A084941, A084942, A084943, A084944.

Sequence in context: A111465 A247029 A108994 * A132853 A259666 A084879

Adjacent sequences:  A006469 A006470 A006471 * A006473 A006474 A006475




N. J. A. Sloane



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

License Agreements, Terms of Use, Privacy Policy .

Last modified May 27 22:57 EDT 2017. Contains 287210 sequences.