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 A167557 #12 Jun 15 2016 13:10:22
%S A167557 1,1,4,2,12,32,6,48,160,384,24,240,960,2688,6144,120,1440,6720,21504,
%T A167557 55296,122880,720,10080,53760,193536,552960,1351680,2949120,5040,
%U A167557 80640,483840,1935360,6082560,16220160,38338560,82575360
%N A167557 The lower left triangle of the ED1 array A167546.
%C A167557 We discovered that the numbers that appear in the lower left triangle of the ED1 array A167546 (m <= n) behave in a regular way, see the formula below. This rather simple regularity doesn't show up in the upper right triangle of the ED1 array (m > n).
%H A167557 G. C. Greubel, <a href="/A167557/b167557.txt">Table of n, a(n) for the first 50 rows</a>
%F A167557 a(n,m) = 4^(m-1)*(m-1)!*(n+m-2)!/(2*m-2)!.
%e A167557 The first few triangle rows are:
%e A167557 [1]
%e A167557 [1, 4]
%e A167557 [2, 12, 32]
%e A167557 [6, 48, 160, 384]
%e A167557 [24, 240, 960, 2688, 6144]
%e A167557 [120, 1440, 6720, 21504, 55296, 122880]
%p A167557 a := proc(n, m): 4^(m-1)*(m-1)!*(n+m-2)!/(2*m-2)! end: seq(seq(a(n, m), m=1..n), n=1..8); # _Johannes W. Meijer_, revised Nov 23 2012
%t A167557 Flatten[Table[(4^(m-1) (m-1)!(n+m-2)!)/(2m-2)!,{n,10},{m,n}]] (* _Harvey P. Dale_, Sep 29 2013 *)
%Y A167557 A167546 is the ED1 array.
%Y A167557 A047053 and A167558 are the first two right hand triangle columns.
%Y A167557 A000142, 4*A001710 (n>=2), 32*A001720, 384*A001730, 6144*A049389, 122880*A051431 are the first six left hand triangle columns.
%Y A167557 A167559 equals the row sums.
%K A167557 easy,nonn,tabl
%O A167557 1,3
%A A167557 _Johannes W. Meijer_, Nov 10 2009