A210918 Number of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= 10 for all x.

1, 1, 4, 26, 243, 2992, 45906, 845287, 18182926, 447797646, 12429760889, 382432412429, 12895551865341, 472172004983602, 18636388954609376, 788226102638064075, 35549770035085876130, 1702625512220935301410, 86287522467158470208030, 4612838996164892567266399

Offset

0,3

Comments

R is early confluent iff (xRy and xRz) implies (yRz or zRy) for all x, y, z.

References

A. P. Heinz (1990). Analyse der Grenzen und Möglichkeiten schneller Tableauoptimierung. PhD Thesis, Albert-Ludwigs-Universität Freiburg, Freiburg i. Br., Germany.

Links

Alois P. Heinz, Table of n, a(n) for n = 0..200

Formula

E.g.f.: t_10(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.

Maple

t:= proc(k) option remember;
      `if`(k<0, 0, unapply(exp(add(x^m/m!*t(k-m)(x), m=1..k)), x))
    end:
gf:= t(10)(x):
a:= n-> n!*coeff(series(gf, x, n+1), x, n):
seq(a(n), n=0..30);

Mathematica

t[k_] := t[k] = If[k<0, 0, Function[x, Exp[Sum[x^m/m!*t[k-m][x], {m, 1, k}]]]]; gf = t[10][x]; a[n_] := n!*SeriesCoefficient[gf, {x, 0, n}]; Table[a[n], {n, 0, 30}] (* Jean-François Alcover, Feb 13 2014, after Maple *)

Crossrefs

Column k=10 of A135302.

Sequence in context: A210915 A210916 A210917 * A052880 A090357 A322766

Adjacent sequences: A210915 A210916 A210917 * A210919 A210920 A210921

Keyword

nonn

Author

Alois P. Heinz, Mar 29 2012

Status

approved