login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A218110 Number of transitive reflexive early confluent binary relations R on n+10 labeled elements with max_{x}(|{y : xRy}|) = n. 2

%I #13 Aug 02 2021 08:47:36

%S 0,1,383478987,1976799958367,686016182577453,82847673438018762,

%T 6177363078563029080,368141001305925742232,19785139747357478264082,

%U 1016521929886047797022408,51404873131596488549863350,2597923441011463423121994276,132340384137811145863910654038

%N Number of transitive reflexive early confluent binary relations R on n+10 labeled elements with max_{x}(|{y : xRy}|) = n.

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

%H Alois P. Heinz, <a href="/A218110/b218110.txt">Table of n, a(n) for n = 0..200</a>

%F a(n) = A135313(n+10,n).

%p t:= proc(k) option remember; `if` (k<0, 0, unapply (exp (add (x^m/m! *t(k-m)(x), m=1..k)), x)) end: tt:= proc(k) option remember; unapply ((t(k)-t(k-1))(x), x) end: T:= proc(n, k) option remember; coeff (series (tt(k)(x), x, n+1), x, n) *n! end:

%p a:= n-> T(n+10,n): seq (a(n), n=0..20);

%t m = 10; f[0, _] = 1; f[k_, x_] := f[k, x] = Exp[Sum[x^m/m!*f[k-m, x], {m, 1, k}]]; (* t = A135302 *) t[0, 0] = 1; t[_, 0] = 0; t[n_, k_] := t[n, k] = SeriesCoefficient[f[k, x], {x, 0, n}]*n!; a[0] = 0; a[n_] := t[n+m, n]-t[n+m, n-1]; Table[a[n], {n, 0, 20}] (* _Jean-François Alcover_, Feb 14 2014 *)

%K nonn

%O 0,3

%A _Alois P. Heinz_, Oct 20 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 12:26 EDT 2024. Contains 371254 sequences. (Running on oeis4.)