|
%I #16 Aug 02 2021 08:00:36
%S 1,1,4,26,243,2992,41223,660220,11979669,243048992,5448497434,
%T 133595966164,3555887814602,102064563003898,3141580135645330,
%U 103198691666336823,3602725068242695657,133174089439019869924,5195463138498447345478,213295995976349091757666
%N Number of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= 5 for all x.
%C R is early confluent iff (xRy and xRz) implies (yRz or zRy) for all x, y, z.
%D A. P. Heinz (1990). Analyse der Grenzen und Möglichkeiten schneller Tableauoptimierung. PhD Thesis, Albert-Ludwigs-Universität Freiburg, Freiburg i. Br., Germany.
%H Alois P. Heinz, <a href="/A210913/b210913.txt">Table of n, a(n) for n = 0..200</a>
%F E.g.f.: t_5(x), where t_k(x) = exp (Sum_{m=1..k} x^m/m! * t_{k-m}(x)) for k>=0 and t_k(x) = 0 otherwise.
%p t:= proc(k) option remember;
%p `if`(k<0, 0, unapply(exp(add(x^m/m!*t(k-m)(x), m=1..k)), x))
%p end:
%p gf:= t(5)(x):
%p a:= n-> n!*coeff(series(gf, x, n+1), x, n):
%p seq(a(n), n=0..30);
%t t[0, _] = 1; t[k_, x_] := t[k, x] = Exp[Sum[x^m/m!*t[k - m, x], {m, 1, k}]]; a[0, 0] = 1; a[_, 0] = 0; a[n_, k_] := SeriesCoefficient[t[k, x], {x, 0, n}]*n!; Table[a[n, 5], {n, 0, 30} ] (* _Jean-François Alcover_, Feb 04 2014, after A135302 and _Alois P. Heinz_ *)
%Y Column k=5 of A135302.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Mar 29 2012
|
