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 A103353 #15 Aug 09 2018 05:09:26
%S A103353 1,2,20,512,25392,2093472,260555392,45819233280,10849051434240,
%T A103353 3334632688448000,1292876470540099584,617862114722159788032,
%U A103353 357118557050589336432640,245715466325821945360588800,198568949299946066906578944000,186309450278791634742517692366848
%N A103353 First column of triangular matrix A103244.
%H A103353 J.-B. Priez, A. Virmaux, <a href="http://arxiv.org/abs/1411.4161">Non-commutative Frobenius characteristic of generalized parking functions: Application to enumeration</a>, arXiv:1411.4161 [math.CO], 2014-2015.
%F A103353 For n>1: 0 = Sum_{k=1..n} C(n-1, k-1)*(-k^2-k)^(n-k)*a(k).
%t A103353 nmax = 16;
%t A103353 P = Table[If[n >= k, (-k^2-k)^(n-k)/(n-k)!, 0], {n, 1, nmax}, {k, 1, nmax}] // Inverse;
%t A103353 T[n_, k_] := If[n < k || k < 1, 0, P[[n, k]] (n - k)!];
%t A103353 a[n_] := T[n, 1];
%t A103353 Array[a, nmax] (* _Jean-François Alcover_, Aug 09 2018, from PARI *)
%o A103353 (PARI) {a(n)=local(P);if(n>=1, P=matrix(n,n,r,c,if(r>=c,(-c^2-c)^(r-c)/(r-c)!))); return(if(n<1,0,(P^-1)[n,1]*(n-1)!))}
%Y A103353 Cf. A103244.
%K A103353 nonn
%O A103353 1,2
%A A103353 _Paul D. Hanna_, Feb 02 2005