This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A218107 #14 Aug 02 2021 08:30:13
%S A218107 0,1,608832,378725365,42483670075,2440299822081,106818340013957,
%T A218107 4210378306984993,160415345420268510,6093096859120003590,
%U A218107 234104217274598884642,9167943015777908270142,367520396335132750893274,15117877192137817244318510,638973577773301815522889410
%N A218107 Number of transitive reflexive early confluent binary relations R on n+7 labeled elements with max_{x}(|{y : xRy}|) = n.
%C A218107 R is early confluent iff (xRy and xRz) implies (yRz or zRy) for all x, y, z.
%H A218107 Alois P. Heinz, <a href="/A218107/b218107.txt">Table of n, a(n) for n = 0..200</a>
%F A218107 a(n) = A135313(n+7,n).
%p A218107 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 A218107 a:= n-> T(n+7,n): seq (a(n), n=0..20);
%t A218107 m = 7; 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 A218107 nonn
%O A218107 0,3
%A A218107 _Alois P. Heinz_, Oct 20 2012