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 A049326 #8 Mar 31 2012 13:19:59
%S A049326 1,10,1,50,20,1,125,200,30,1,125,1250,450,40,1,0,5250,4375,800,50,1,0,
%T A049326 15000,30375,10500,1250,60,1,0,28125,157500,100500,20625,1800,70,1,0,
%U A049326 31250,621875,740000,250625,35750,2450,80,1,0,15625,1875000,4318750
%N A049326 A convolution triangle of numbers generalizing Pascal's triangle A007318.
%H A049326 W. Lang, <a href="http://www.cs.uwaterloo.ca/journals/JIS/index.html">On generalizations of Stirling number triangles</a>, J. Integer Seqs., Vol. 3 (2000), #00.2.4.
%F A049326 a(n, m) = 5*(5*m-n+1)*a(n-1, m)/n + m*a(n-1, m-1)/n, n >= m >= 1; a(n, m) := 0, n<m; a(n, 0) := 0; a(1, 1)=1. G.f. for m-th column: (x*p(4, x))^m, p(4, x) := 1+10*x+50*x^2+125*x^3+125*x^4 (row polynomial of A033842(4, m)).
%e A049326 {1}; {10,1}; {50,20,1}; {125,200,30,1}; {125,1250,450,40,1}; ...
%Y A049326 a(n, m) := s1(-4, n, m), a member of a sequence of triangles including s1(0, n, m)= A023531(n, m) (unit matrix) and s1(2, n, m)=A007318(n-1, m-1) (Pascal's triangle). s1(-1, n, m)= A030528.
%Y A049326 Cf. A049350.
%K A049326 easy,nonn,tabl
%O A049326 1,2
%A A049326 _Wolfdieter Lang_