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 A113144 #11 Sep 08 2013 13:30:50
%S A113144 1,1,2,7,41,364,4409,67573,1248626,26948347,664414997,18409263772,
%T A113144 566018365445,19117946453041,703533848468330,28013710891743007,
%U A113144 1199943043040160401,55013996422974758476,2687888298887895948065,139414898768304344206141
%N A113144 Row 3 of table A113143; equal to INVERT of triple (or 3-fold) factorials shifted one place right.
%F A113144 a(n) = Sum_{j=0..k} 3^(k-j)*A111146(k, j).
%F A113144 a(0) = 1; a(n+1) = Sum_{k=0..n} a(k)*A007559(n-k).
%F A113144 G.f.: 1/(Q(0)-x) where Q(k) = 1 - x*(3*k+1)/( 1 - x*(3*k+3)/Q(k+1) ); (continued fraction). - _Sergei N. Gladkovskii_, Mar 21 2013
%e A113144 A(x) = 1 + x + 2*x^2 + 7*x^3 + 41*x^4 + 364*x^5 + 4409*x^6
%e A113144 +...
%e A113144 = 1/(1 - x - x^2 - 4*x^3 - 28*x^4 -...- A007559(n)*x^(n+1)
%e A113144 -...).
%o A113144 (PARI) {a(n)=local(x=X+X*O(X^n)); A=1/(1-x-x^2*sum(j=0,n,x^j*prod(i=0,j,3*i+1)));return(polcoeff(A,n,X))}
%Y A113144 Cf. A113143, A007559 (3-fold factorials).
%K A113144 nonn
%O A113144 0,3
%A A113144 _Philippe Deléham_ and _Paul D. Hanna_, Oct 28 2005