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!)
A261238 Number of transitive reflexive early confluent binary relations R on 2n labeled elements where max_{x}(|{y:xRy}|)=n. 2

%I #25 Jun 27 2022 07:45:46

%S 1,1,61,12075,4798983,3151808478,3085918099231,4210378306984993,

%T 7631859877504516225,17735784941946000072572,

%U 51404873131596488549863350,181773929944698613445522139632,770224297920086034338727292711511,3852558194920465350481058381000064850

%N Number of transitive reflexive early confluent binary relations R on 2n labeled elements where 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="/A261238/b261238.txt">Table of n, a(n) for n = 0..100</a>

%F a(n) = A135313(2n,n).

%F a(n) ~ c * d^n * n^(2*n), where d = 4.307069427308178... and c = 0.2607079596895... - _Vaclav Kotesovec_, Nov 20 2021

%p t:= proc(k) option remember; `if`(k<0, 0,

%p exp(add(x^m/m!*t(k-m), m=1..k)))

%p end:

%p A:= proc(n, k) option remember;

%p coeff(series(t(k), x, n+1), x, n) *n!

%p end:

%p a:= n-> A(2*n,n) -A(2*n,n-1):

%p seq(a(n), n=0..14);

%t t[k_] := t[k] = If[k < 0, 0, Exp[Sum[x^m/m!*t[k-m], {m, 1, k}]]];

%t A[n_, k_] := A[n, k] = SeriesCoefficient[t[k], {x, 0, n}]*n!;

%t a[n_] := A[2n, n] - A[2n, n-1];

%t Table[a[n], {n, 0, 14}] (* _Jean-François Alcover_, Jun 27 2022, after _Alois P. Heinz_ *)

%Y Cf. A135313.

%K nonn

%O 0,3

%A _Alois P. Heinz_, Nov 18 2015

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 April 19 07:26 EDT 2024. Contains 371782 sequences. (Running on oeis4.)