|
%I #22 Aug 22 2021 14:01:33
%S 0,0,1,4,30,216,1440,11040,112560,1229760,14333760,179988480,
%T 2259290880,30656102400,446269824000,6949355212800,123855443712000,
%U 2320686111744000,45616912653312000,939726185029632000,20166054423330816000
%N Conflicts during insertions into exchange trees on n nodes.
%H Markus E. Nebel, <a href="http://wwwagak.cs.uni-kl.de/downloads/papers/Digital_Search_Trees_with_Keys_of_Variable_Length.pdf">Digital Search Trees with Keys of Variable Length</a>, R.A.I.R.O. Theoretical Informatics and Applications 30 (6), 1996, 507 - 520 (see (3) on p. 6).
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F See PARI program.
%o (PARI) b(n) = if (n == 0, 0, if (n == 1, 0, b(n\2) + b((n-1)\2) + (n-1)/n));
%o lista(nn) = {for(n=0, nn, print1(n!*b(n), ", "););} \\ _Michel Marcus_, Aug 13 2013
%K nonn
%O 0,4
%A Markus Nebel [ nebel(AT)sads.informatik.uni-frankfurt.de ]
%E More terms from _Michel Marcus_, Aug 15 2013
|
