login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218096 Number of transitive reflexive early confluent binary relations R on n labeled elements with max_{x}(|{y : xRy}|) = 6. 2
4683, 137774, 3794378, 105494886, 3068829477, 94494907584, 3085918099231, 106818340013957, 3913397076494906, 151442406160585540, 6177363078563029080, 265028384609314768260, 11934799080680963824449, 563007076962063332175612, 27770258520873025001499693 (list; graph; refs; listen; history; text; internal format)
OFFSET

6,1

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 = 6..150

FORMULA

E.g.f.: t_6(x)-t_5(x), with t_k(x) = exp (Sum_{m=1..k} x^m/m! * t_{k-m}(x)) if k>=0 and t_k(x) = 0 else.

a(n) = A210914(n) - A210913(n).

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:

egf:= t(6)(x)-t(5)(x):

a:= n-> n!* coeff(series(egf, x, n+1), x, n):

seq(a(n), n=6..20);

MATHEMATICA

m = 6; t[k_] := t[k] = If[k<0, 0, Function[x, Exp[Sum[x^m/m!*t[k-m][x], {m, 1, k}]]]] ; egf = t[m][x]-t[m-1][x]; a[n_] := n!*Coefficient[Series[egf, {x, 0, n+1}], x, n]; Table[a[n], {n, m, 20}] (* Jean-François Alcover, Feb 14 2014, after Maple *)

CROSSREFS

Column k=6 of A135313.

Sequence in context: A190131 A226801 A320620 * A293583 A263066 A252773

Adjacent sequences:  A218093 A218094 A218095 * A218097 A218098 A218099

KEYWORD

nonn

AUTHOR

Alois P. Heinz, Oct 20 2012

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 00:25 EDT 2019. Contains 323472 sequences. (Running on oeis4.)