

A000169


Number of labeled rooted trees with n nodes: n^(n1).
(Formerly M1946 N0771)


204



1, 2, 9, 64, 625, 7776, 117649, 2097152, 43046721, 1000000000, 25937424601, 743008370688, 23298085122481, 793714773254144, 29192926025390625, 1152921504606846976, 48661191875666868481, 2185911559738696531968, 104127350297911241532841, 5242880000000000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Also the number of connected transitive subtree acyclic digraphs on n vertices.  Robert Castelo (rcastelo(AT)imim.es), Jan 06 2001
For any given integer k a(n) is also is the number of functions from {1,2,...,n} to {1,2,...,n} such that the sum of the function values is k mod n.  Sharon Sela (sharonsela(AT)hotmail.com), Feb 16 2002
The nth term of a geometric progression with first term 1 and common ratio n: a(1) = 1 > 1,1,1,1,... a(2) = 2 > 1,2,... a(3) = 9 > 1,3,9,... a(4) = 64 > 1,4,16,64,...  Amarnath Murthy, Mar 25 2004
All rational solutions to the equation x^y = y^x, with x < y, are given by x = A000169(n+1)/A000312(n), y = A000312(n+1)/A007778(n), where n = 1, 2, 3, ... .  Nick Hobson, Nov 30 2006
a(n+1) is also the number of partial functions on n labeled objects.  Franklin T. AdamsWatters, Dec 25 2006
In other words, if A is a finite set of size n1, then a(n) is the number of binary relations on A that are also functions. Note that a(n) = sum(binomial(n1,k)*(n1)^k, k=0..n1)=n^(n1), where binomial(n1,k) is the number of ways to select a domain D of size k from A and (n1)^k is the number of functions from D to A.  Dennis P. Walsh, Apr 21 2011
More generally, consider the class of sequences of the form a(n)=[n*c(1)*...*c(i)]^(n1). This sequence has c(1)=1. A052746 has a(n) = [2*n]^(n1), A052756 has a(n)=[3*n]^(n1),A052764 has a(n)=[4*n]^(n1), A052789 has a(n)=[5*n]^(n1). These sequences have a combinatorial structure like simple grammars.  Ctibor O. Zizka, Feb 23 2008
a(n) is equal to the logarithmic transform of the sequence b(n) = n^(n2) starting at b(2).  Kevin Hu (10thsymphony(AT)gmail.com), Aug 23 2010
Also, number of labeled connected multigraphs of order n without cycles except one loop. See link below to have a picture showing the bijection between rooted trees and multigraphs of this kind. (Note that there are no labels in the picture, but the bijection remains true if we label the nodes.)  Washington Bomfim, Sep 04 2010
a(n) is also the number of functions f:{1,2,...,n} > {1,2,...,n} such that f(1) = 1.
For a signed version of A000169 arising from the Vandermonde determinant of (1,1/2,...,1/n), see the Mathematica section.  Clark Kimberling, Jan 02 2012
Numerator of (1+1/(n1))^(n1) for n>1.  JeanFrançois Alcover, Jan 14 2013
Right edge of triangle A075513.  Michel Marcus, May 17 2013
a(n+1) is the number of n x n binary matrices with no more than a single one in each row. Partitioning the set of such matrices by the number k of rows with a one, we obtain a(n+1)=sum(k=0..n, binomial(n,k)*n^k)=(n+1)^n.  Dennis P. Walsh, May 27 2014
Central terms of triangle A051129: a(n) = A051129(2*n1,n).  Reinhard Zumkeller, Sep 14 2014


REFERENCES

J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 524.
Hannes Heikinheimo, Heikki Mannila and Jouni K. Seppnen, Finding Trees from Unordered 01 Data, in Knowledge Discovery in Databases: PKDD 2006, Lecture Notes in Computer Science, Volume 4213/2006, SpringerVerlag. [From N. J. A. Sloane, Jul 09 2009]
Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 63.
J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 128.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see page 25, Prop. 5.3.2.


LINKS

N. J. A. Sloane, Table of n, a(n) for n = 1..100
Paul Barry and Aoife Hennessy, Generalized Narayana Polynomials, Riordan Arrays, and Lattice Paths, Journal of Integer Sequences, Vol. 15, 2012, #12.4.8.  N. J. A. Sloane, Oct 08 2012
W. Bomfim, Bijection between rooted forests and multigraphs without cycles except one loop in each connected component. [From W. Bomfim, Sep 04 2010]
David Callan, A Combinatorial Derivation of the Number of Labeled Forests, J. Integer Seqs., Vol. 6, 2003.
P. J. Cameron and P. Cara, Independent generating sets and geometries for symmetric groups, J. Algebra, Vol. 258, no. 2 (2002), 641650.
R. Castelo and A. Siebes, A characterization of moral transitive directed acyclic graph Markov models as trees, Technical Report CS200044, Faculty of Computer Science, University of Utrecht.
R. Castelo and A. Siebes, A characterization of moral transitive acyclic directed graph Markov models as labeled trees, J. Statist. Planning Inference, 115(1):235259, 2003.
F. Chapoton, F. Hivert, J.C. Novelli, A setoperad of formal fractions and dendriformlike suboperads, arXiv preprint arXiv:1307.0092, 2013
N. Hobson, Exponential equation.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 67
F. Ruskey, Information on Rooted Trees
N. J. A. Sloane, Illustration of initial terms
Eric Weisstein's World of Mathematics, Graph Vertex
D. Zvonkine, An algebra of power series...
Index entries for sequences related to rooted trees
Index entries for sequences related to trees
Index entries for "core" sequences


FORMULA

The e.g.f. T(x) = Sum_{n=1..infinity} n^(n1)*x^n/n! satisfies T(x) = x*exp(T(x)), so T(x) is the functional inverse (series reversion) of x*exp(x).
Also T(x) = LambertW(x) where W(x) is the principal branch of Lambert's function.
T(x) is sometimes called Euler's tree function.
a(n) = A000312(n1)*A128434(n,1)/A128433(n,1).  Reinhard Zumkeller, Mar 03 2007
E.g.f.: LambertW(x)=x*G(0) ; G(k)= 1  x*((2*k+2)^(2*k))/(((2*k+1)^(2*k))  x*((2*k+1)^(2*k))*((2*k+3)^(2*k+1))/(x*((2*k+3)^(2*k+1))  ((2*k+2)^(2*k+1))/G(k+1))); (continued fraction).  Sergei N. Gladkovskii, Dec 30 2011
a(n)= Sum_{i=1..n} binomial(n1,i1)*i^(i2)*(ni)^(ni).  Dmitry Kruchinin, Oct 28 2013


EXAMPLE

For n=3, a(3)=9 because there are exactly 9 binary relations on A={1, 2} that are functions, namely: {}, {(1,1)}, {(1,2)}, {(2,1)}, {(2,2)}, {(1,1),(2,1)}, {(1,1),(2,2)}, {(1,2),(2,1)} and {(1,2),(2,2)}.  _Dennis P. Walsh, Apr 21 2011
x + 2*x^2 + 9*x^3 + 64*x^4 + 625*x^5 + 7776*x^6 + 117649*x^7 + ...


MAPLE

A000169 := n> n^(n1);
spec := [A, {A=Prod(Z, Set(A))}, labeled]; [seq(combstruct[count](spec, size=n), n=1..20)];
for n to 7 do ST := [seq(seq(i, j = 1 .. n), i = 1 .. n)]; PST := powerset(ST); Result[n] := nops(PST) end do; seq(Result[n], n = 1 .. 7); # Thomas Wieder, Feb 07 2010


MATHEMATICA

Table[n^(n  1), {n, 1, 20}] (* Stefan Steinerberger, Apr 01 2006 *)
Range[0, 18]! CoefficientList[ Series[ Exp[ Log[1  LambertW[x]]], {x, 0, 18}], x] (* Robert G. Wilson v *)
(* Next, a signed version A000169 from the Vandermonde determinant of (1, 1/2, ..., 1/n) *)
f[j_] := 1/j; z = 12;
v[n_] := Product[Product[f[k]  f[j], {j, 1, k  1}], {k, 2, n}]
Table[v[n], {n, 1, z}]
1/% (* A203421 *)
Table[v[n]/v[n + 1], {n, 1, z  1}] (* A000169 signed *)
(* Clark Kimberling, Jan 02 2012 *)


PROG

(PARI) {a(n) = if( n<1, 0, n^(n1))}
(Mupad) n^(n1) $ n=1..20 /* Zerinvary Lajos, Apr 01 2007 */
(PARI) /* Computation via e.g.f. by series reversion of x*exp(x): */
N=66; x='x+O('x^N);
egf=serreverse(x*exp(x));
Vec(serlaplace(egf))
/* Joerg Arndt, May 25 2011 */
(Haskell)
a000169 n = n ^ (n  1)  Reinhard Zumkeller, Sep 14 2014


CROSSREFS

Cf. A000055, A000081, A000272, A000312, A007778, A007830, A008785A008791, A055860.
See also A053506A053509.
Cf. A002061.
Cf. A052746, A052756, A052764, A052789.
Cf. A051129, A247363.
Sequence in context: A055860 A152917 A213236 * A112319 A232552 A038038
Adjacent sequences: A000166 A000167 A000168 * A000170 A000171 A000172


KEYWORD

easy,core,nonn,nice


AUTHOR

N. J. A. Sloane


STATUS

approved



