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 A210911 #23 Dec 05 2016 10:37:45
%S A210911 1,1,4,26,168,1416,13897,153126,1893180,25796852,383636151,6177688914,
%T A210911 106969864696,1980478817526,39015578535585,814416108606566,
%U A210911 17947777613632128,416233580676722424,10129555365300697267,258028441032419619786,6864011282184757297896
%N A210911 Number of transitive reflexive early confluent binary relations R on n labeled elements where |{y : xRy}| <= 3 for all x.
%C A210911 R is early confluent iff (xRy and xRz) implies (yRz or zRy) for all x, y, z.
%D A210911 A. P. Heinz (1990). Analyse der Grenzen und Möglichkeiten schneller Tableauoptimierung. PhD Thesis, Albert-Ludwigs-Universität Freiburg, Freiburg i. Br., Germany.
%H A210911 Alois P. Heinz, <a href="/A210911/b210911.txt">Table of n, a(n) for n = 0..448</a>
%F A210911 E.g.f.: exp(x*exp(x*exp(x)+x^2/2)+x^2/2*exp(x)+x^3/6).
%p A210911 gf:= exp(x*exp(x*exp(x)+x^2/2)+x^2/2*exp(x)+x^3/6):
%p A210911 a:= n-> n!* coeff(series(gf,x,n+1), x, n):
%p A210911 seq(a(n), n=0..30);
%t A210911 t[0, _] = 1; t[k_, x_] := t[k, x] = Exp[Sum[x^m/m!*t[k-m, x], {m, 1, k}]]; a[0, 0] = 1; a[_, 0] = 0; a[n_, k_] := SeriesCoefficient[t[k, x], {x, 0, n}]*n!; Table[a[n, 3], {n, 0, 30} ] (* _Jean-François Alcover_, Feb 04 2014, after A135302 and _Alois P. Heinz_ *)
%Y A210911 Column k=3 of A135302.
%K A210911 nonn
%O A210911 0,3
%A A210911 _Alois P. Heinz_, Mar 29 2012