cp's OEIS Frontend

A055897 a(n) = n*(n-1)^(n-1).

%I A055897 #61 Jan 26 2022 09:05:41
%S A055897 1,2,12,108,1280,18750,326592,6588344,150994944,3874204890,
%T A055897 110000000000,3423740047332,115909305827328,4240251492291542,
%U A055897 166680102383370240,7006302246093750000,313594649253062377472,14890324713954061755186,747581753430634213933056
%N A055897 a(n) = n*(n-1)^(n-1).
%C A055897 Total number of leaves in all labeled rooted trees with n nodes.
%C A055897 Number of endofunctions of [n] such that no element of [n-1] is fixed. E.g., a(3)=12: 123 -> 331, 332, 333, 311, 312, 313, 231, 232, 233, 211, 212, 213.
%C A055897 Number of functions f: {1, 2, ..., n} --> {1, 2, ..., n} such that f(1) != f(2), f(2) != f(3), ..., f(n-1) != f(n). - _Warut Roonguthai_, May 06 2006
%C A055897 Determinant of the n X n matrix ((2n, n^2, 0, ..., 0), (1, 2n, n^2, 0, ..., 0), (0, 1, 2n, n^2, 0, ..., 0), ..., (0, ..., 0, 1, 2n)). - _Michel Lagneau_, May 04 2010
%C A055897 For n > 1: a(n) = A240993(n-1) / A240993(n-2). - _Reinhard Zumkeller_, Aug 31 2014
%C A055897 Total number of points m such that f^(-1)(m) = {m}, (i.e., the preimage of m is the singleton set {m}) summed over all functions f:[n]->[n]. - _Geoffrey Critzer_, Jan 20 2022
%H A055897 Vincenzo Librandi, <a href="/A055897/b055897.txt">Table of n, a(n) for n = 1..200</a>
%H A055897 Frank Ellermann, <a href="/A001792/a001792.txt">Illustration of binomial transforms</a>
%H A055897 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A055897 E.g.f.: x/(1-T), where T=T(x) is Euler's tree function (see A000169).
%F A055897 a(n) = Sum_{k=1..n} A055302(n, k)*k.
%F A055897 a(n) = the n-th term of the (n-1)-th binomial transform of {1, 1, 4, 18, 96, ..., (n-1)*(n-1)!, ...} (cf. A001563). - _Paul D. Hanna_, Nov 17 2003
%F A055897 a(n) = (n-1)^(n-1) + Sum_{i=2..n} (n-1)^(n-i)*binomial(n-1, i-1)*(i-1) *(i-1)!. - _Paul D. Hanna_, Nov 17 2003
%F A055897 a(n) = [x^(n-1)] 1/(1 - (n-1)*x)^2. - _Paul D. Hanna_, Dec 27 2012
%F A055897 a(n) ~ exp(-1) * n^n. - _Vaclav Kotesovec_, Nov 14 2014
%p A055897 A055897:=n->`if`(n=1,1,n*(n-1)^(n-1)); seq(A055897(n), n=1..20); # _Wesley Ivan Hurt_, Jun 26 2014
%t A055897 Join[{1},Table[n(n-1)^(n-1), {n,2,20}]] (* _Harvey P. Dale_, Jul 18 2011 *)
%o A055897 (PARI) {a(n)=polcoeff(1/(1-n*x+x*O(x^n))^2, n)} \\ _Paul D. Hanna_, Dec 27 2012
%o A055897 (Magma) [n*(n-1)^(n-1): n in [1..20]] // _Wesley Ivan Hurt_, Jun 26 2014
%o A055897 (Haskell)
%o A055897 a055897 n = n * (n - 1) ^ (n - 1) -- _Reinhard Zumkeller_, Aug 31 2014
%o A055897 (Sage) [n*(n-1)^(n-1) for n in (1..20)] # _G. C. Greubel_, Aug 10 2019
%o A055897 (GAP) List([1..20], n-> n*(n-1)^(n-1)); # _G. C. Greubel_, Aug 10 2019
%Y A055897 Cf. A003227, A003228, A055314, A055540, A055541, A060226, A118537.
%Y A055897 Cf. A240993. Diagonal of A265583.
%K A055897 nonn
%O A055897 1,2
%A A055897 _Christian G. Bower_, Jun 12 2000
%E A055897 Additional comments from _Vladeta Jovovic_, Mar 31 2001 and _Len Smiley_, Dec 11 2001