The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A066319 A labeled structure simultaneously a tree and a cycle. 2

%I

%S 1,1,6,96,3000,155520,12101040,1321205760,192849310080,36288000000000,

%T 8556520581100800,2471543044256563200,858447696200353459200,

%U 353034171594345598156800,169665960401437500000000000

%N A labeled structure simultaneously a tree and a cycle.

%D F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 68 (2.1.37).

%H G. C. Greubel, <a href="/A066319/b066319.txt">Table of n, a(n) for n = 1..230</a>

%H D. E. Knuth, <a href="https://doi.org/10.1090/S0002-9939-1989-0949878-9">A recurrence related to trees</a>, Proc. Amer. Math. Soc. 105 (1989), 335-349. Reprinted as Chapter 39 of Selected Papers on Discrete Mathematics by D. E. Knuth.

%H Thorsten Weist, <a href="https://arxiv.org/abs/1203.2740">On the Euler characteristic of Kronecker moduli spaces</a>, arXiv preprint arXiv:1203.2740 [math.RT], 2012. Cor. 5.3, k=1. But offset 0.

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

%F a(n) = n^(n-2)*(n-1)!.

%t Table[n!*n^(n-3), {n,1,20}] (* _G. C. Greubel_, May 29 2019 *)

%o (PARI) a(n) = n^(n-2)*(n-1)!; \\ _Michel Marcus_, May 29 2019

%o (MAGMA) [n^(n-3)*Factorial(n): n in [1..20]]; // _G. C. Greubel_, May 29 2019

%o (Sage) [n^(n-3)*factorial(n) for n in (1..20)] # _G. C. Greubel_, May 29 2019

%K nonn

%O 1,3

%A _Christian G. Bower_, Dec 13 2001

%E Knuth reference from _David Callan_, Feb 07 2004

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

Last modified April 12 10:06 EDT 2021. Contains 342920 sequences. (Running on oeis4.)