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 A051782 #19 Jun 27 2016 17:23:25
%S A051782 1,0,2,-12,122,-1620,26882,-536172,12506762,-334261380,10075002962,
%T A051782 -338180323932,12512502202202,-505992958647540,22204726014875042,
%U A051782 -1050993549782729292,53373431773793542442,-2894886293042487680100,167021024758368026331122
%N A051782 Apply the "Stirling-Bernoulli transform" to Catalan numbers.
%C A051782 The "Stirling-Bernoulli transform" maps a sequence b_0, b_1, b_2, ... to a sequence c_0, c_1, c_2, ..., where if B has o.g.f. B(x), c has e.g.f. exp(x)*B(1-exp(x)). More explicitly, c_n = Sum_{m=0..n} (-1)^m*m!*Stirling2(n+1,m+1)*b_m.
%H A051782 Alois P. Heinz, <a href="/A051782/b051782.txt">Table of n, a(n) for n = 0..200</a>
%F A051782 a(n) = Sum_{k = 0..n} A163626(n,k)*A000108(k). - _Philippe Deléham_, May 25 2015
%p A051782 a:= n-> add((-1)^k *k! *Stirling2(n+1, k+1)*binomial(2*k, k)/
%p A051782 (k+1), k=0..n):
%p A051782 seq(a(n), n=0..20); # _Alois P. Heinz_, May 17 2013
%t A051782 a[n_] := Sum[(-1)^k k! StirlingS2[n+1, k+1] CatalanNumber[k], {k, 0, n}];
%t A051782 Table[a[n], {n, 0, 18}] (* _Jean-François Alcover_, Apr 06 2016 *)
%Y A051782 Cf. A000108, A163626.
%K A051782 sign
%O A051782 0,3
%A A051782 _N. J. A. Sloane_, Dec 09 1999