%I M1946 N0771
%S 1,2,9,64,625,7776,117649,2097152,43046721,1000000000,25937424601,
%T 743008370688,23298085122481,793714773254144,29192926025390625,
%U 1152921504606846976,48661191875666868481,2185911559738696531968,104127350297911241532841,5242880000000000000000000
%N Number of labeled rooted trees with n nodes: n^(n1).
%C Also the number of connected transitive subtree acyclic digraphs on n vertices.  Robert Castelo (rcastelo(AT)imim.es), Jan 06 2001
%C 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
%C 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
%C 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
%C a(n+1) is also the number of partial functions on n labeled objects.  _Franklin T. AdamsWatters_, Dec 25 2006
%C 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_{k=0..n1} binomial(n1,k)*(n1)^k = 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
%C 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) for n>0. These sequences have a combinatorial structure like simple grammars.  _Ctibor O. Zizka_, Feb 23 2008
%C 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
%C 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
%C a(n) is also the number of functions f:{1,2,...,n} > {1,2,...,n} such that f(1) = 1.
%C 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
%C Numerator of (1+1/(n1))^(n1) for n>1.  _JeanFrançois Alcover_, Jan 14 2013
%C Right edge of triangle A075513.  _Michel Marcus_, May 17 2013
%C 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
%C Central terms of triangle A051129: a(n) = A051129(2*n1,n).  _Reinhard Zumkeller_, Sep 14 2014
%C a(n) is the row sum of the nth rows of A248120 and A055302, so it enumerates the number of monomials in the expansion of [x(1) + x(2) + ... + x(n)]^(n1).  _Tom Copeland_, Jul 17 2015
%C For any given integer k, a(n) is the number of sums x_1 + ... + x_m = k (mod n) such that: x_1, ..., x_m are nonnegative integers less than n, the order of the summands does not matter, and each integer appears fewer than n times as a summand.  _Carlo Sanna_, Oct 04 2015
%C a(n) is the number of words of length n1 over an alphabet of n letters.  _Joerg Arndt_, Oct 07 2015
%C a(n) is the number of parking functions whose largest element is n and length is n. For example, a(3) = 9 because there are nine such parking functions, namely (1,2,3), (1,3,2), (2,3,1), (2,1,3), (3,1,2), (3,2,1), (1,1,3), (1,3,1), (3,1,1).  _Ran Pan_, Nov 15 2015
%C Consider the following problem: n^2 cells are arranged in a square array. A step can be defined as going from one cell to the one directly above it, to the right of it or under it. A step above cannot be followed by a step below and vice versa. Once the last column of the square array is reached, you can only take steps down. a(n) is the number of possible paths (i.e., sequences of steps) from the cell on the bottom left to the cell on the bottom right.  _Nicolas Nagel_, Oct 13 2016
%C The rationals c(n) = a(n+1)/a(n), n >= 1, appear in the proof of G. Pólya's ``elementary, but not too elementary, theorem'': Sum_{n>=1} (Product_{k=1..n} a_k)^(1/n) < exp(1)*Sum_{n>=1} a_n, for n >= 1, with the sequence {a_k}_{k>=1} of nonnegative terms, not all equal to 0.  _Wolfdieter Lang_, Mar 16 2018
%C Coefficients of the generating series for the preLie operadic algebra. Cf. p. 417 of the Loday et al. paper.  _Tom Copeland_, Jul 08 2018
%D Miklos Bona, editor, Handbook of Enumerative Combinatorics, CRC Press, 2015, page 169.
%D J. L. Gross and J. Yellen, eds., Handbook of Graph Theory, CRC Press, 2004; p. 524.
%D 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.  _N. J. A. Sloane_, Jul 09 2009
%D Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 63.
%D J. Riordan, An Introduction to Combinatorial Analysis, Wiley, 1958, p. 128.
%D N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
%D N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
%D R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see page 25, Prop. 5.3.2.
%H N. J. A. Sloane, <a href="/A000169/b000169.txt">Table of n, a(n) for n = 1..100</a>
%H Paul Barry and Aoife Hennessy, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL15/Barry2/barry190r.html">Generalized Narayana Polynomials, Riordan Arrays, and Lattice Paths</a>, Journal of Integer Sequences, Vol. 15, 2012, #12.4.8.  _N. J. A. Sloane_, Oct 08 2012
%H W. Bomfim, <a href="http://en.wikipedia.org/wiki/File:Bijecao.gif">Bijection between rooted forests and multigraphs without cycles except one loop in each connected component.</a> [From W. Bomfim, Sep 04 2010]
%H David Callan, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL6/Callan/callan10.html">A Combinatorial Derivation of the Number of Labeled Forests</a>, J. Integer Seqs., Vol. 6, 2003.
%H P. J. Cameron and P. Cara, <a href="http://dx.doi.org/10.1016/S00218693(02)005501">Independent generating sets and geometries for symmetric groups</a>, J. Algebra, Vol. 258, no. 2 (2002), 641650.
%H R. Castelo and A. Siebes, <a href="http://ftp.cs.uu.nl:/pub/RUU/CS/techreps/CS2000/200044.ps.gz">A characterization of moral transitive directed acyclic graph Markov models as trees</a>, Technical Report CS200044, Faculty of Computer Science, University of Utrecht.
%H R. Castelo and A. Siebes, <a href="http://dx.doi.org/10.1016/S03783758(02)00143X">A characterization of moral transitive acyclic directed graph Markov models as labeled trees</a>, J. Statist. Planning Inference, 115(1):235259, 2003.
%H F. Chapoton, F. Hivert, J.C. Novelli, <a href="http://arxiv.org/abs/1307.0092">A setoperad of formal fractions and dendriformlike suboperads</a>, arXiv preprint arXiv:1307.0092 [math.CO], 2013
%H R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, <a href="http://dx.doi.org/10.1007/BF02124750">On the Lambert W Function</a>, Advances in Computational Mathematics, volume 5, 1996, 329359.
%H N. Hobson, <a href="http://www.qbyte.org/puzzles/p048s.html">Exponential equation</a>.
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=67">Encyclopedia of Combinatorial Structures 67</a>
%H JL. Loday and B. Vallette <a href="http://irma.math.unistra.fr/~loday/PAPERS/LodayVallette.pdf">Algebraic Operads</a>, version 0.99, 2012.
%H G. Pólya, <a href="http://www.jstor.org/stable/2305566">With, or Without, Motivation?</a> Amer. Math. Monthly, 56 (149) 684691. Reprinted in `A Century of Mathematics', John Ewing (ed.), Math. Assoc. of Amer., 1994, pp. 195200 (the reference there is wrong).
%H Gwenaël Richomme, <a href="https://arxiv.org/abs/1808.02680">Characterization of infinite LSP words and endomorphisms preserving the LSP property</a>, arXiv:1808.02680 [cs.DM], 2018.
%H F. Ruskey, <a href="https://web.archive.org/web/20160714032428/http://theory.cs.uvic.ca/inf/tree/RootedTree.html">Information on Rooted Trees</a>
%H N. J. A. Sloane, <a href="/A000081/a000081.html">Illustration of initial terms</a>
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/GraphVertex.html">Graph Vertex</a>
%H D. Zvonkine, <a href="http://www.arXiv.org/abs/math.AG/0403092">An algebra of power series...</a>, arXiv:math/0403092 [math.AG], 2004.
%H <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%H <a href="/index/Cor#core">Index entries for "core" sequences</a>
%F The e.g.f. T(x) = Sum_{n>=1} 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).
%F Also T(x) = LambertW(x) where W(x) is the principal branch of Lambert's function.
%F T(x) is sometimes called Euler's tree function.
%F a(n) = A000312(n1)*A128434(n,1)/A128433(n,1).  _Reinhard Zumkeller_, Mar 03 2007
%F 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
%F a(n) = Sum_{i=1..n} binomial(n1,i1)*i^(i2)*(ni)^(ni).  _Dmitry Kruchinin_, Oct 28 2013
%F a(n)/A000312(n1) > e, as n > oo.  _Daniel Suteu_, Jul 23 2016
%e 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
%e G.f. = x + 2*x^2 + 9*x^3 + 64*x^4 + 625*x^5 + 7776*x^6 + 117649*x^7 + ...
%p A000169 := n> n^(n1);
%p spec := [A, {A=Prod(Z,Set(A))}, labeled]; [seq(combstruct[count](spec,size=n), n=1..20)];
%p 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
%t Table[n^(n  1), {n, 1, 20}] (* _Stefan Steinerberger_, Apr 01 2006 *)
%t Range[0, 18]! CoefficientList[ Series[ Exp[ Log[1  LambertW[x]]], {x, 0, 18}], x] (* _Robert G. Wilson v_ *)
%t (* Next, a signed version A000169 from the Vandermonde determinant of (1,1/2,...,1/n) *)
%t f[j_] := 1/j; z = 12;
%t v[n_] := Product[Product[f[k]  f[j], {j, 1, k  1}], {k, 2, n}]
%t Table[v[n], {n, 1, z}]
%t 1/% (* A203421 *)
%t Table[v[n]/v[n + 1], {n, 1, z  1}] (* A000169 signed *)
%t (* _Clark Kimberling_, Jan 02 2012 *)
%o (PARI) a(n) = n^(n1)
%o (PARI) N=66; x='x+O('x^N); egf=serreverse(x*exp(x)); Vec(serlaplace(egf)) \\ Computation via e.g.f. by series reversion of x*exp(x).  _Joerg Arndt_, May 25 2011
%o (MuPAD) n^(n1) $ n=1..20 /* _Zerinvary Lajos_, Apr 01 2007 */
%o (Haskell) a000169 n = n ^ (n  1)  _Reinhard Zumkeller_, Sep 14 2014
%o (MAGMA) [n^(n1): n in [1..20]]; // _Vincenzo Librandi_, Jul 17 2015
%Y Cf. A000055, A000081, A000272, A000312, A007778, A007830, A008785A008791, A055860, A002061, A052746, A052756, A052764, A052789, A051129, A247363, A055302, A248120, A130293, A053506A053509.
%Y Other classes of endofunctions: A275549A275558.
%K easy,core,nonn,nice
%O 1,2
%A _N. J. A. Sloane_
